%%%%%%%%%%%%%%%%%%%%%%%%%% %%%%% bib of gs001 %%%%%%%%%%%%%%%%%%%%%%%%%% @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, } %%%%%%%%%%%%%%%%%%%%%%%%%% %%%%% bib of gs002 %%%%%%%%%%%%%%%%%%%%%%%%%% %% Theory of Computing %% File: gs537.bib %% Publication date: March 5, 2011 %% Authors: Andrew Drucker and Ronald de Wolf %% Theory of Computing %% File: gs537.bib %% Publication date: March 5, 2011 %% Authors: Andrew Drucker and Ronald de Wolf @comment{Theory of Computing. An Open Access Journal} @string{TheoryComput="Theory of Computing"} @comment{Proceedings of The Royal Society of London. Series A. Mathematical, Physical and Engineering Sciences} @string{ProcRSocLondSerAMathPhysEngSci="Proc. R. Soc. Lond. Ser. A Math. Phys. Eng. Sci."} @comment{SIAM Journal on Computing} @string{SIAMJComput="SIAM J. Comput."} @comment{SIAM Journal on Numerical Analysis} @string{SIAMJNumerAnal="SIAM J. Numer. Anal."} @comment{Journal of the ACM} @string{JACM="J. ACM"} @comment{Electronic Colloquium on Computational Complexity (ECCC)} @string{eccc="Electron. Colloq. on Comput. Complexity (ECCC)"} @comment{Journal of Computer and System Sciences} @string{JComputSystemSci="J. Comput. System Sci."} @comment{Mathematische Annalen} @string{MathAnn="Math. Ann."} @comment{Computational Complexity} @string{CompComplex="Comput. Complexity"} @comment{Theory of Computing Systems} @string{TheoryComputSyst="Theory Comput. Syst."} @comment{Theoretical Computer Science} @string{TheoretComputSci="Theoret. Comput. Sci."} @comment{Mathematische Zeitschrift} @string{MathZ="Math. Z."} @comment{Information and Computation} @string{InformandComput="Inform. and Comput."} @comment{Algorithmica. An International Journal in Computer Science} @string{Algorithmica="Algorithmica"} @comment{Information Processing Letters} @string{InformProcessLett="Inform. Process. Lett."} @comment{Rossiiskaya Akademiya Nauk. Problemy Peredachi Informatsii} @string{ProblemyPeredachiInformatsii="Problemy Peredachi Informatsii"} @comment{Rossiiskaya Akademiya Nauk. Matematicheskie Zametki} @string{MatZametki="Mat. Zametki"} @comment{Methods and Applications of Analysis} @string{MethodsApplAnal="Methods Appl. Anal."} @comment{Transactions of the American Mathematical Society} @string{TransAmerMathSoc="Trans. Amer. Math. Soc."} @comment{Combinatorica. An International Journal on Combinatorics and the Theory of Computing} @string{Combinatorica="Combinatorica"} @comment{Combinatorics, Probability and Computing} @string{CombinProbabComput="Combin. Probab. Comput."} @comment{Random Structures & Algorithms} @string{RandomStructuresAlgorithms="Random Structures Algorithms"} @comment{Foundations and Trends in Theoretical Computer Science} @string{FoundTrendsTheorComputSci="Found. Trends Theor. Comput. Sci."} @comment{Quaderni di Matematica} @string{QuadMat="Quad. Mat."} @comment{Journal of Machine Learning Research (JMLR)} @string{JMachLearnRes="J. Mach. Learn. Res."} @comment{Quantum Information & Computation} @string{QuantumInfComput="Quantum Inf. Comput."} @comment{Lecture Notes in Computer Science} @string{LectureNotesinComputSci="Lecture Notes in Comput. Sci."} @Article{ aaronson:advicecommj, author = "Scott Aaronson", title = "Limitations of quantum advice and one-way communication", journal = TheoryComput, volume = "1", year = "2005", pages = "1--28", note = "Earlier version in Proc. 19th IEEE Conf. Comput. Complex., 2004 and arxiv:quant-ph/0402095", doi = "10.4086/toc.2005.v001a001" } @InProceedings{ aaronson:pp, author = "Scott Aaronson", title = "Quantum Computing, Postselection, and Probabilistic Polynomial-Time", booktitle = ProcRSocLondSerAMathPhysEngSci, volume = "A461(2063)", pages = "3473--3482", year = "2005", note = "Earlier version in arxiv:quant-ph/0412187", doi = "10.1098/rspa.2005.1546" } @Article{ aaronson:localsearchj, author = "Scott Aaronson", title = "Lower Bounds for Local Search by Quantum Arguments", journal = SIAMJComput, volume = "35", number = "4", year = "2006", pages = "804--824", note = "Earlier version in STOC '03 and arxiv:quant-ph/0307149", doi="10.1137/S0097539704447237" } @Article{ aaronson&shi:collision, author = "Scott Aaronson and Yaoyun Shi", title = "Quantum Lower Bounds for the Collision and the Element Distinctness Problems", journal = JACM, volume = "51", number = "4", year = "2004", pages = "595--605", doi = "10.1145/1008731.1008735" } @Article{ adh:qcomputability, author = "Leonard M. Adleman and Jonathan DeMarrais and Ming-Deh A. Huang", title = "Quantum Computability", journal = SIAMJComput, volume = "26", number = "5", pages = "1524--1540", year = "1997", doi = "10.1137/S0097539795293639" } @InProceedings{ aharonov®ev:latticeqnp, author = "Dorit Aharonov and Oded Regev", title = "A lattice problem in quantum {NP}", booktitle = "Proc. 44th FOCS", publisher="IEEE Comp. Soc. Press", pages = "210--219", year = "2003", note = "Earlier version in arxiv:quant-ph/0307220", doi = "10.1109/SFCS.2003.1238195" } @Article{ aharonov®ev:latticenpconp, author = "Dorit Aharonov and Oded Regev", title = "Lattice Problems in {NP} intersect {coNP}", note = "Earlier version in FOCS '04", journal = JACM, volume = "52", number = "5", pages = "749--765", year = "2005", doi="10.1145/1089023.1089025" } @InProceedings{ ajtai:hardlattice, author = "Mikl{\'o}s Ajtai", title = "Generating Hard Instances of Lattice Problems (Extended Abstract)", booktitle = "Proc. 28th STOC", year = "1996", pages = "99--108", publisher = "ACM Press", bibsource = "DBLP, http://dblp.uni-trier.de", doi = "10.1145/237814.237838" } @InProceedings{ ajtaidwork:lattice97, author = "Mikl{\'o}s Ajtai and Cynthia Dwork", title = "A Public-Key Cryptosystem with Worst-Case/Average-Case Equivalence", booktitle = "Proc. 29th STOC", publisher = "ACM Press", year = "1997", pages = "284--293", bibsource = "DBLP, http://dblp.uni-trier.de", doi = "10.1145/258533.258604" } @Article{ ajtaidwork:lattice07, author = "Mikl{\'o}s Ajtai and Cynthia Dwork", title = "The First and Fourth Public-Key Cryptosystems with Worst-Case/Average-Case Equivalence.", journal = eccc, volume = "14", number = "097", year = "2007", ee = "http://eccc.hpi-web.de/eccc-reports/2007/TR07-097/index.html" , bibsource = "DBLP, http://dblp.uni-trier.de", eprint="eccc:TR07-097" } @InProceedings{ aks:sieve, author = "Mikl{\'o}s Ajtai and Ravi Kumar and D. Sivakumar", title = "A sieve algorithm for the shortest lattice vector problem", booktitle = "Proc. 33rd STOC", publisher = "ACM Press", year = "2001", pages = "601--610", ee = "http://doi.acm.org/10.1145/380752.380857", bibsource = "DBLP, http://dblp.uni-trier.de", doi = "10.1145/380752.380857" } @Unpublished{ alon:rigidity, author = "Noga Alon", title = "On the rigidity of an {Hadamard} matrix", year = "1990", note = "Manuscript. His proof may be found in~\cite[Section~15.1.2]{jukna:excom}" } @Book{ alon&spencer:probmethod, author = "Noga Alon and Joel H. Spencer", title = "The Probabilistic Method", publisher = "Wiley-Interscience", edition = "third", year = "2008" } @Article{ ambainis:lowerboundsj, author = "Andris Ambainis", title = "Quantum lower bounds by quantum arguments", journal = JComputSystemSci, volume = "64", number = "4", pages = "750--767", year = "2002", note = "Earlier versions in STOC '00 and arxiv:quant-ph/0002066", doi = "10.1006/jcss.2002.1826" } @Article{ ambainis:degreevsqueryj, author = "Andris Ambainis", title = "Polynomial degree {vs.} quantum query complexity", journal = JComputSystemSci, volume = "72", number = "2", year = "2006", pages = "220--238", note = "Earlier versions in FOCS '03 and arxiv:quant-ph/0305028", doi="10.1016/j.jcss.2005.06.006" } @Article{ acrsz:andorj, author = "Andris Ambainis and A. Childs and Ben W. Reichardt and Robert {\v{S}}palek and S. Zhang", title = "Any {AND-OR} formula of size {$N$} can be evaluated in time {$N^{1/2+o(1)}$} on a quantum computer", journal = SIAMJComput, volume = "39", number = "6", pages = "2513--2530", year = "2010", note = "Earlier version in FOCS '07", doi = "10.1137/080712167" } @Article{ ambainis:racj, author = "Andris Ambainis and Ashwin Nayak and Amnon Ta-Shma and Umesh Vazirani", title = "Dense quantum coding and quantum finite automata", journal = JACM, volume = "49", number = "4", year = "2002", pages = "496--511", ee = "http://doi.acm.org/10.1145/581771.581773", bibsource = "DBLP, http://dblp.uni-trier.de", note = "Earlier version in STOC '99", doi = "10.1145/581771.581773" } @Book{ babai&frankl:linalg, author = "L{\'a}szl{\'o} Babai and P{\'e}ter Frankl", title = "Linear Algebra Methods in Combinatorics, with Applications to Geometry and Computer Science", year = "1992", publisher = "University of Chicago", note = "Unpublished manuscript, available from \url{http://www.cs.uchicago.edu/research/publications/combinatorics}" } @InProceedings{ bfs:classes, author = "L{\'a}szl{\'o} Babai and P{\'e}ter Frankl and Janos Simon", title = "Complexity Classes in Communication Complexity Theory", booktitle = "Proc. 27th FOCS", publisher="IEEE Comp. Soc. Press", pages = "337--347", year = "1986", doi = "10.1109/SFCS.1986.15" } @Article{ banasz:transference, author = "W. Banaszczyk", title = "New Bounds in some Transference Theorems in the Geometry of Numbers", journal = MathAnn, volume = "296", number = "4", year = "1993", pages = "625--635", doi = "10.1007/BF01445125" } @InProceedings{ bjks:itcc, author = "Ziv {Bar-Yossef} and T. S. Jayram and Ravi Kumar and D. Sivakumar", title = "Information Theory Methods in Communication Complexity", booktitle = "Proc. 17th IEEE Conf. Comput. Complex., 2002", pages = "93--102", year = "2002", doi = "10.1109/CCC.2002.1004344" } @Article{ bjks:datastream, author = "Ziv {Bar-Yossef} and T. S. Jayram and Ravi Kumar and D. Sivakumar", title = "An information statistics approach to data stream and communication complexity", journal = JComputSystemSci, volume = "68", number = "4", year = "2004", pages = "702--732", ee = "http://dx.doi.org/10.1016/j.jcss.2003.11.006", bibsource = "DBLP, http://dblp.uni-trier.de", note = "Earlier version in FOCS '02", doi = "10.1016/j.jcss.2003.11.006" } @Article{ bbcmw:polynomialsj, author = "Robert Beals and Harry Buhrman and Richard Cleve and Michele Mosca and Ronald de Wolf", title = "Quantum Lower Bounds by Polynomials", journal = JACM, volume = "48", number = "4", pages = "778--797", year = "2001", note = "Earlier versions in FOCS '98 and arxiv:quant-ph/9802049", doi="10.1145/502090.502097" } @Article{ beigel:perceptrons, author = "Richard Beigel", title = "Perceptrons, {PP}, and the Polynomial Hierarchy", journal = CompComplex, volume = "4", pages = "339--349", year = "1994", doi = "10.1007/BF01263422" } @Article{ brs:ppclosed, author = "Richard Beigel and Nick Reingold and Daniel Spielman", title = "{PP} Is Closed under Intersection", journal = JComputSystemSci, volume = "50", number = "2", pages = "191--202", year = "1995", doi = "10.1006/jcss.1995.1017" } @InProceedings{ brw:hypercontractive, author = "Avraham {Ben-Aroya} and Oded Regev and Ronald de Wolf", title = "A Hypercontractive Inequality for Matrix-Valued Functions with Applications to Quantum Computing and {LDC}s", booktitle = "Proc. 49th FOCS", publisher="IEEE Comp. Soc. Press", pages = "477--486", year = "2008", note = "Earlier version in arxiv:quant-ph/0705.3806", doi = "10.1109/FOCS.2008.45" } @Article{ bbbv:str&weak, author = "Charles H. Bennett and Ethan Bernstein and Gilles Brassard and Umesh Vazirani", title = "Strengths and Weaknesses of Quantum Computing", journal = SIAMJComput, volume = "26", number = "5", pages = "1510--1523", year = "1997", note = "Earlier version in arxiv:quant-ph/9701001", doi = "10.1137/S0097539796300933" } @Article{ bernstein:weierstrass, author = "S. N. Bernstein", title = "{D\'{e}monstration du th\'{e}or\`{e}me de Weierstrass fond\'{e}e sur le calcul des probabilit\'{e}s}", journal = "Communications de la Soci\'{e}t\'{e} Mathematique de Kharkov", volume = "13", pages = "1--2", year = "1912" } @InCollection{ bhmt:countingj, author = "Gilles Brassard and P. H{\o}yer and Michele Mosca and Alain Tapp", title = "Quantum Amplitude Amplification and Estimation", booktitle = "Quantum Computation and Quantum Information: A Millennium Volume", series = "AMS Contemporary Mathematics Series", publisher = "American Mathematical Society", volume = "305", pages = "53--74", year = "2002", note = "Earlier version in arxiv:quant-ph/0005055" } @InProceedings{bcwz:qerror, author= "Harry Buhrman and Richard Cleve and Ronald de Wolf and Christof Zalka", title = "Bounds for Small-Error and Zero-Error Quantum Algorithms", booktitle = "Proc. 40th FOCS", publisher="IEEE Comp. Soc. Press", note = "Earlier version in arxiv:cs.CC/9904019", pages = "358--368", year = "1999", doi = "10.1109/SFFCS.1999.814607" } @Article{ bmrv:bitvectorsj, author = "Harry Buhrman and Miltersen, P. B. and Jaikumar Radhakrishnan and S. Venkatesh", title = "Are Bitvectors Optimal?", journal = SIAMJComput, volume = "31", number = "6", pages = "1723--1744", year = "2002", note = "Earlier version in STOC '00", doi = "10.1137/S0097539702405292" } @Article{ bnrw:robustqj, author = "Harry Buhrman and Ilan Newman and Hein R{\"o}hrig and Ronald de Wolf", title = "Robust Polynomials and Quantum Algorithms", journal = TheoryComputSyst, volume = "40", number = "4", pages = "379--395", year = "2007", note = "Special issue on STACS 2005. Earlier version in arxiv:quant-ph/0309220", doi="10.1007/s00224-006-1313-z" } @InProceedings{ bvw:smallbias, author = "Harry Buhrman and Nikolay Vereshchagin and Ronald de Wolf", title = "On computation and communication with small bias", booktitle = "Proc. 22nd IEEE Conf. Comput. Complex.", pages = "24--32", year = "2007", doi = "10.1109/CCC.2007.18" } @Article{ buhrman&wolf:dectreesurvey, author = "Harry Buhrman and Ronald de Wolf", title = "Complexity Measures and Decision Tree Complexity: {A} Survey", journal = TheoretComputSci, volume = "288", number = "1", pages = "21--43", year = "2002", doi = "10.1016/S0304-3975(01)00144-X" } @InProceedings{ chakrabarti®ev:nn, author = "Amit Chakrabarti and Oded Regev", title = "An Optimal Randomised Cell Probe Lower Bound for Approximate Nearest Neighbour Searching", booktitle = "Proc. 45th FOCS", publisher="IEEE Comp. Soc. Press", pages = "473--482", year = "2004", doi = "10.1137/080729955" } @InProceedings{ cswy:directsum, author = "Amit Chakrabarti and Yaoyun Shi and Anthony Wirth and Andrew Chi-Chih Yao", title = "Informational Complexity and the Direct Sum Problem for Simultaneous Message Complexity", booktitle = "Proc. 42nd FOCS", publisher="IEEE Comp. Soc. Press", pages = "270--278", year = "2001", doi = "10.1109/SFCS.2001.959901" } @Article{ cgks:pir, author = "Benny Chor and Oded Goldreich and Eyal Kushilevitz and Madhu Sudan", title = "Private Information Retrieval", journal = JACM, volume = "45", number = "6", pages = "965--981", year = "1998", note = "Earlier version in FOCS '95", doi = "10.1145/293347.293350" } @InProceedings{ christandl:horn, author = "Matthias Christandl", title = "A Quantum Information-Theoretic Proof of the Relation between {H}orn's Problem and the {L}ittlewood-{R}ichardson Coefficients", booktitle = "Proc. 4th Conf. Computability in Europe (CiE)", series = LectureNotesinComputSci, volume = "5028", year = "2008", pages = "120--128", doi = "10.1145/293347.293350" } @InProceedings{ cdnt:ip, author = "Richard Cleve and Wim {van Dam} and Michael Nielsen and Alain Tapp", title = "Quantum Entanglement and the Communication Complexity of the Inner Product Function", booktitle = "Proc. 1st NASA Intern. Conf. Quantum Comput. Quantum Comm.", series = LectureNotesinComputSci, volume = "1509", publisher = "Springer", pages = "61--74", year = "1998", note = "Earlier version in arxiv:quant-ph/9708019", doi = "10.1007/3-540-49208-9\_4" } @Book{ cover&thomas:infoth, author = "Thomas M. Cover and Joy A. Thomas", title = "Elements of Information Theory", publisher = "Wiley", year = "1991" } @Article{ drucker&wolf:jackson, author = "Andrew Drucker and Ronald de Wolf", title = "Uniform Approximation by (Quantum) Polynomials", journal = "Quantum Information and Computation", year = "2011", number = "3\&4", pages = "215--225", note = "\url{http://www.rintonpress.com/journals/qiconline.html\#v11n34}. Earlier version in arxiv:1008.1599", } @InProceedings{ efremenko:ldc, author = "Klim Efremenko", title = "3-Query Locally Decodable Codes of Subexponential Length", booktitle = "Proc. 41st STOC", publisher = "ACM Press", pages = "39--44", year = "2009", doi = "10.1145/1536414.1536422" } @Article{ ehlich&zeller:schwankung, author = "H. Ehlich and K. Zeller", title = "Schwankung von {P}olynomen zwischen {G}itterpunkten", journal = MathZ, volume = "86", pages = "41--44", year = "1964" } @Article{ epr, author = "A. Einstein and B. Podolsky and N. Rosen", title = "Can quantum-mechanical description of physical reality be considered complete?", journal = "Phys. Rev.", volume = "47", pages = "777--780", year = "1935" } @Article{ fgg:nandtreej, author = "Edward Farhi and Jeffrey Goldstone and Sam Gutmann", title = "A Quantum Algorithm for the {H}amiltonian {NAND} Tree", journal = TheoryComput, volume = "4", number = "1", pages = "169--190", year = "2008", note = "Earlier version in arxiv:quant-ph/0702144", doi = "10.4086/toc.2008.v004a008" } @Article{ feige&al:computingwithnoisyinformation, author = "Uriel Feige and Prabhakar Raghavan and David Peleg and Eli Upfal", title = "Computing with noisy information", journal = SIAMJComput, volume = "23", number = "5", pages = "1001--1018", year = "1994", note = "Earlier version in STOC '90", doi = "10.1137/S0097539791195877" } @Misc{ fortnow&grochow:equivalence, author = "Lance Fortnow and Joshua A. Grochow", title = "Complexity Classes of Equivalence Problems Revisited", note = "Earlier version in arXiv:0907.4775", year = "2009" } @Article{ fortnow&reingold:pptt, author = "Lance Fortnow and Nick Reingold", title = "{PP} is closed under truth-table reductions", journal = InformandComput, volume = "124", number = "1", pages = "1--6", year = "1996", doi = "10.1137/S0097539791195877" } @Article{ fortnow&rogers:limitations, author = "Lance Fortnow and John Rogers", title = "Complexity Limitations on Quantum Computation", journal = JComputSystemSci, volume = "59", number = "2", pages = "240--252", year = "1999", note = "Earlier version in Proc. 13th IEEE Conf. Comput. Complex., 1998 and arxiv:cs.CC/9811023", doi = "10.1006/jcss.1999.1651" } @PhDThesis{ gill:pp, author = "John T. Gill, III", title = "Probabilistic Turing Machines and Complexity of Computation", school = "UC Berkeley", address = "Berkeley, California", year = "1972" } @Article{ grw:keyagree, author = "Nicolas Gisin and Renato Renner and Stefan Wolf", title = "Linking Classical and Quantum Key Agreement: Is There a Classical Analog to Bound Entanglement?", journal = Algorithmica, volume = "34", number = "4", pages = "389--412", year = "2002", note = "Earlier version in Crypto '00", doi = "10.1007/s00453-002-0972-7" } @Article{ goldreich&goldwasser:latticeprobs, author = "Oded Goldreich and Shafi Goldwasser", title = "On the Limits of Nonapproximability of Lattice Problems", journal = JComputSystemSci, volume = "60", number = "3", year = "2000", pages = "540--563", bibsource = "DBLP, http://dblp.uni-trier.de", note = "Earlier version in STOC '98", doi = "10.1137/S0097539702405292" } @Article{ gkst:lowerpir, author = "Oded Goldreich and Howard Karloff and Leonard J. Schulman and Luca Trevisan", title = "Lower Bounds for Linear Locally Decodable Codes and Private Information Retrieval", journal = CompComplex, volume = "15", number = "3", pages = "263--296", year = "2006", note = "Earlier version in Proc. 17th IEEE Conf. Comput. Complex., 2002", doi = "10.1007/s00037-006-0216-3" } @Article{ gmss99, author = "Oded Goldreich and Daniele Micciancio and Safra, S. and Seifert, J-P.", title = "Approximating shortest lattice vectors is not harder than approximating closest lattice vectors", journal = InformProcessLett, volume = "71", number = "2", pages = "55--61", year = "1999", doi = "10.1016/S0020-0190(99)00083-6" } @InProceedings{ graaf&wolf:qyao, author = "Mart de Graaf and Ronald de Wolf", title = "On Quantum Versions of the {Y}ao Principle", booktitle = "Proc. 19th Ann. Symp. Theor. Aspects of Comput. Sci. (STACS)", series = LectureNotesinComputSci, volume = "2285", publisher = "Springer", pages = "347--358", year = "2002", note = "Earlier version in arxiv:quant-ph/0109070", doi = "10.1007/3-540-45841-7\_28" } @InProceedings{ grover:search, author = "Lov K. Grover", title = "A Fast Quantum Mechanical Algorithm for Database Search", booktitle = "Proc. 28th STOC", publisher = "ACM Press", pages = "212--219", year = "1996", note = "Earlier version in arxiv:quant-ph/9605043", doi = "10.1145/237814.237866" } @Article{ hastad:demorgan, author = "Johan H{\aa}stad", title = "The shrinkage exponent of de {M}organ formulas is 2", journal = SIAMJComput, volume = "27", number = "1", pages = "48--64", year = "1998", doi = "10.1137/S0097539794261556" } @InProceedings{ havivr07, author = "Ishay Haviv and Oded Regev", title = "Tensor-based Hardness of the Shortest Vector Problem to within Almost Polynomial Factors", booktitle = "Proc. 39th STOC", publisher = "ACM Press", year = "2007", pages = "469--477", doi = "10.1145/1250790.1250859" } @Article{ holevo, author = "A. S. Holevo", title = "Bounds for the quantity of information transmitted by a quantum communication channel", journal = ProblemyPeredachiInformatsii, volume = "9", number = "3", pages = "3--11", year = "1973", note = "English translation in {\it Problems Inform. Transmission}, 9:177--183, 1973. \url{http://mi.mathnet.ru/eng/ppi903}" } @InProceedings{ hls:madv, author = "P. H{\o}yer and Troy Lee and Robert {\v{S}}palek", title = "Negative weights make adversaries stronger", booktitle = "Proc. 39th STOC", publisher = "ACM Press", pages = "526--535", year = "2007", note = "Earlier version in arxiv:quant-ph/0611054", doi = "10.1145/1250790.1250867" } @InProceedings{hmw:berrorsearch, author = "P. H{\o}yer and Michele Mosca and Ronald de Wolf", title = "Quantum Search on Bounded-Error Inputs", booktitle = "Proc. 30th Intern. Colloq. Autom. Lang. Program. (ICALP)", series = LectureNotesinComputSci, volume = "2719", publisher = "Springer", pages = "291--299", year = "2003", note = "Earlier version in arxiv:quant-ph/0304052", doi = "10.1007/3-540-45061-0\_25" } @InProceedings{ ipry:qpp, author = "Kazuo Iwama and Harumichi Nishimura and Rudy Raymond and Shigeru Yamashita", title = "Unbounded-Error Classical and Quantum Communication Complexity", booktitle = "Proc. 18th Intern. Symp. Algorithms Comput. (ISAAC)", series = LectureNotesinComputSci, volume = "4835", pages = "100--111", publisher = "Springer", year = "2007", note = "Earlier version in arXiv:0709.2761", doi="10.1007/978-3-540-77120-3\_11" } @PhDThesis{ jackson:thesis, author = "D. Jackson", title = {\"{U}ber die {G}enauigkeit der {A}nn\"{a}herung stetiger {F}unktionen durch ganze rationale {F}unktionen gegebenen {G}rades und trigonometrische {S}ummen gegebener {O}rdnung}, school = {University of G\"{o}ttingen}, year = "1911" } @InProceedings{ jkr:readonce, title = "On the communication complexity of read-once {$AC^0$} formulae", author = "T. S. Jayram and S. Kopparty and P. Raghavendra", booktitle = "Proc. 24th IEEE Conf. Comput. Complex.", pages = "329--340", year = "2009", doi = "10.1109/CCC.2009.39" } @InProceedings{ jks:2apps, author = "T. S. Jayram and Ravi Kumar and D. Sivakumar", title = "Two applications of information complexity", booktitle = "Proc. 35th STOC", publisher = "ACM Press", pages = "673--682", year = "2003", doi = "10.1145/780542.780640" } @Book{ jukna:excom, author = "Stasys Jukna", title = "Extremal Combinatorics, With Applications in Computer Science", series = "EATCS Series", publisher = "Springer", year = "2001" } @Article{ kashin&razborov:rigidity, author = "B. Kashin and Alexander A. Razborov", title = "Improved Lower Bounds on the Rigidity of {H}adamard Matrices", journal = MatZametki, volume = "63", number = "4", pages = "535--540", year = "1998", note = "In Russian", } @InProceedings{ katz&trevisan:ldc, 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", pages = "80--86", year = "2000", doi="10.1145/335305.335315" } @InProceedings{ kerenidis:qcircuit, author = "Iordanis Kerenidis", title = "Quantum multiparty communication complexity and circuit lower bounds", booktitle = "Proc. 4th Ann. Conf. Theory and Appl. Models of Comput. (TAMC)", series = LectureNotesinComputSci, volume = "4484", pages = "306--317", publisher = "Springer", year = "2007", note = "Earlier version in arxiv:quant-ph/0504087", doi="10.1007/978-3-540-72504-6\_28" } @Article{ kerenidis&wolf:qldcj, author = "Iordanis Kerenidis and Ronald de Wolf", title = "Exponential Lower Bound for 2-Query Locally Decodable Codes via a Quantum Argument", journal = JComputSystemSci, volume = "69", number = "3", pages = "395--420", year = "2004", note = "Earlier versions in STOC '03 and arxiv:quant-ph/0208062", doi="10.1016/j.jcss.2004.04.007" } @Article{ khot:hardlatticej, author = "Subhash Khot", title = "Hardness of approximating the shortest vector problem in lattices", journal = JACM, volume = "52", number = "5", year = "2005", pages = "789--808", doi = "10.1145/1089023.1089027", bibsource = "DBLP, http://dblp.uni-trier.de", note = "Earlier version in FOCS '04" } @Article{ klauck:qcclowerj, author = "Hartmut Klauck", title = "Lower Bounds for Quantum Communication Complexity", journal = SIAMJComput, volume = "37", number = "1", year = "2007", pages = "20--46", doi = "10.1137/S0097539702405620", bibsource = "DBLP, http://dblp.uni-trier.de", note = "Earlier version in FOCS '01 and arxiv:quant-ph/0106160" } @Article{ ksw:dpt-siam, author = "Hartmut Klauck and Robert {\v{S}}palek and Ronald de Wolf", title = "Quantum and Classical Strong Direct Product Theorems and Optimal Time-Space Tradeoffs", journal = SIAMJComput, volume = "36", number = "5", pages = "1472--1493", year = "2007", note = "Earlier version in FOCS '04 and arxiv:quant-ph/0402123", doi="10.1137/05063235X" } @Article{ kuperberg:johansson, author = "Greg Kuperberg", title = "Random words, quantum statistics, central limits, random matrices", journal = MethodsApplAnal, volume = "9", number = "1", pages = "99--118", year = "2002", note = "\url{http://www.intlpress.com/MAA/p/2002/09_1/MAA-09-1-099-118.pdf}. Earlier version in arxiv:math/9909104" } @Article{ kuperberg:tracial, author = "Greg Kuperberg", title = "A tracial quantum central limit theorem", journal = TransAmerMathSoc, volume = "357", pages = "459--471", year = "2005", note = "Earlier version in arxiv:math-ph/0202035", doi="10.1090/S0002-9947-03-03449-4" } @Book{ kushilevitz&nisan:cc, author = "Eyal Kushilevitz and Noam Nisan", title = "Communication Complexity", publisher = "Cambridge University Press", year = "1997" } @Article{ lls:kzbases, author = "J. C. Lagarias and Lenstra, Jr., H. W. and C.-P. Schnorr", title = "Korkin-{Z}olotarev bases and successive minima of a lattice and its reciprocal lattice", journal = Combinatorica, volume = "10", number = "4", year = "1990", pages = "333--348", bibsource = "DBLP, http://dblp.uni-trier.de", doi="10.1007/BF02128669" } @Article{ lls:advformj, author = "Sophie Laplante and Troy Lee and Mario Szegedy", title = "The Quantum Adversary Method and Classical Formula Size Lower Bounds", journal = CompComplex, volume = "15", number = "2", year = "2006", pages = "163--196", doi = "10.1007/s00037-006-0212-7", bibsource = "DBLP, http://dblp.uni-trier.de", note = "Earlier version in Proc. 20th IEEE Conf. Comput. Complex., 2005" } @InProceedings{ laplante&magniez:lower, author = "Sophie Laplante and Frederic Magniez", title = "Lower Bounds for Randomized and Quantum Query Complexity Using {K}olmogorov Arguments", booktitle = "Proc. 19th IEEE Conf. Comput. Complex.", pages = "294--304", year = "2004", note = "Earlier version in arxiv:quant-ph/0311189", doi="10.1109/CCC.2004.1313852" } @Misc{ lee:signdegree, author = "Troy Lee", title = "A note on the sign degree of formulas", year = "2009", eprint = "arxiv:0909.4607" } @InProceedings{ lss:quantumnof, author = "Troy Lee and Gideon Schechtman and Adi Shraibman", title = "Lower bounds on quantum multiparty communication complexity", booktitle = "Proc. 24th IEEE Conf. Comput. Complex.", pages = "254--262", year = "2009", doi="10.1109/CCC.2009.24" } @Article{ lll:lll, author = "A. K. Lenstra and Lenstra, Jr., H. W. and L. Lov{\'a}sz", title = "Factoring polynomials with rational coefficients", journal = MathAnn, volume = "261", number = "4", year = "1982", pages = "515--534" } @Article{ leonardos&saks:readoncej, author = "Nikos Leonardos and Michael Saks", title = "Lower Bounds on the Randomized Communication Complexity of Read-Once Functions", journal = CompComplex, volume = "19", number = "2", year = "2010", pages = "153--181", doi="10.1007/s00037-010-0292-2", bibsource = "DBLP, http://dblp.uni-trier.de" } @Book{ li&vitanyi:kolm3, author = "Ming Li and Paul Vit{\'{a}}nyi", title = "An Introduction to {K}olmogorov Complexity and its Applications", edition = "Third", publisher = "Springer", address = "Berlin", year = "2008" } @Article{ linial&shraibman:learningj, author = "Nati Linial and Adi Shraibman", title = "Learning Complexity vs Communication Complexity", journal = CombinProbabComput, volume = "18", number = "1-2", year = "2009", pages = "227--245", doi = "10.1017/S0963548308009656", bibsource = "DBLP, http://dblp.uni-trier.de", note = "Earlier version in Proc. 22nd IEEE Conf. Computat. Complex., 2008" } @Article{ linial&shraibman:ccj, author = "Nati Linial and Adi Shraibman", title = "Lower bounds in communication complexity based on factorization norms", journal = RandomStructuresAlgorithms, volume = "34", number = "3", year = "2009", pages = "368--394", doi = "10.1002/rsa.20232", bibsource = "DBLP, http://dblp.uni-trier.de", note = "Earlier version in STOC '07" } @Misc{ lipton:qmethodblog, author = "Richard Lipton", title = "Erd{\H{o}}s and the quantum method", year = "March 28, 2009", note = "Blog entry \url{http://rjlipton.wordpress.com/2009/03/28/erds-and-the-quantum-method/}" } @Article{ lokam:rigidity, author = "Satyanarayana V. Lokam", title = "Spectral Methods for Matrix Rigidity with Applications to Size-Depth Trade-offs and Communication Complexity", journal = JComputSystemSci, volume = "63", number = "3", pages = "449--473", year = "2001", note = "Earlier version in FOCS '95", doi="10.1006/jcss.2001.1786" } @InProceedings{ lokam:quadratic, author = "Satyanarayana V. Lokam", title = "Quadratic lower bounds on matrix rigidity", booktitle = "Proc. 3rd Ann. Conf. Theory and Appl. Models of Comput. (TAMC)", series = LectureNotesinComputSci, publisher = "Springer", volume = "3959", pages = "295--307", year = "2006", doi="10.1007/11750321\_28" } @Article{ lokam:linalgsurvey, author = "Satyanarayana V. Lokam", title = "Complexity Lower Bounds using Linear Algebra", journal = FoundTrendsTheorComputSci, volume = "4", number = "1--2", pages = "1--155", year = "2008", doi="10.1561/0400000011" } @Article{ micciancio:almostperfect, author = "Daniele Micciancio", title = "Almost Perfect Lattices, the Covering Radius Problem, and Applications to {A}jtai's Connection Factor", journal = SIAMJComput, volume = "34", number = "1", year = "2004", pages = "118--169", doi="10.1137/S0097539703433511" } @Book{ micciancio&goldwasser:mgbook, author = "Daniele Micciancio and Shafi Goldwasser", title = "Complexity of Lattice Problems: {A} cryptographic perspective", publisher = "Kluwer Academic Publishers", series = "Kluwer Internat. Ser. Engrg. Comput. Sci.", year = "2002", volume = "671", address = "Boston, Massachusetts" } @InCollection{ micciancioregev:chapter, author = "Daniele Micciancio and Oded Regev", title = "Lattice-based Cryptography", booktitle = "Post-quantum Cryptography", editor = "D. J. Bernstein and J. Buchmann and E. Dahmen", pages = "147--191", year = "2009", publisher = "Springer", doi="10.1007/978-3-540-88702-7\_5" } @techreport{ midrijanis:rigidity, author = "Gatis Midrijanis", title = "Three lines proof of the lower bound for the matrix rigidity", month = jun, year = "2005", eprint = "arxiv:cs.CC/0506081", institution = {Arxiv e-print} } @Book{ minsky&papert:perceptrons, author = "Marvin Minsky and Seymour Papert", title = "Perceptrons", publisher = "MIT Press", address = "Cambridge, MA", year = "1968", note = "Second, expanded edition 1988" } @InProceedings{ nayak:qfa, author = "Ashwin Nayak", title = "Optimal lower bounds for quantum automata and random access codes", booktitle = "Proc. 40th FOCS", publisher="IEEE Comp. Soc. Press", pages = "369--376", note = "Earlier version in arxiv:quant-ph/9904093", year = "1999", doi="10.1109/SFFCS.1999.814608" } @Article{ nayak&salzman:entanglementj, author = "Ashwin Nayak and Julia Salzman", title = "Limits on the ability of quantum states to convey classical messages", journal = JACM, volume = "53", number = "1", pages = "184--206", year = "2006", note = "Earlier version in STOC '02", doi="10.1145/1120582.1120587" } @InProceedings{ odonnell&servedio:newdegree, author = "Ryan {O'Donnell} and Rocco Servedio", title = "New degree bounds for polynomial threshold functions", booktitle = "Proc. 35th STOC", publisher = "ACM Press", year = "2003", pages = "325--334", doi="10.1145/780542.780592" } @InProceedings{ paturi:degree, author = "Ramamohan Paturi", title = "On the Degree of Polynomials that Approximate Symmetric {B}oolean Functions", booktitle = "Proc. 24th STOC", publisher = "ACM Press", pages = "468--474", year = "1992", doi="10.1145/129712.129758" } @Article{ paturi&simon:pcc, author = "Ramamohan Paturi and Janos Simon", title = "Probabilistic communication complexity", journal = JComputSystemSci, volume = "33", number = "1", pages = "106--123", year = "1986", note = "Earlier version in FOCS '84", doi="10.1016/0022-0000(86)90046-2" } @InProceedings{ peikert:svpcrypto, author = "Chris Peikert", title = "Public-key cryptosystems from the worst-case shortest vector problem", booktitle = "Proc. 41st STOC", publisher = "ACM Press", year = "2009", pages = "333--342", doi = "10.1145/1536414.1536461", bibsource = "DBLP, http://dblp.uni-trier.de" } @Article{ rsv:qsetmembershipj, author = "Jaikumar Radhakrishnan and Pranab Sen and S. Venkatesh", title = "The Quantum Complexity of Set Membership", journal = Algorithmica, volume = "34", number = "4", pages = "462--479", year = "2002", note = "Earlier versions in FOCS '00 and arvix:quant-ph/0007021", doi="10.1007/s00453-002-0979-0" } @Article{ razborov:qdisj, author = "Alexander A. Razborov", title = "Quantum communication complexity of symmetric predicates", journal = "Izvestiya of the Russian Academy of Sciences, Mathematics", volume = "67", number = "1", pages = "145--159", year = "2003", note = "Earlier version in arxiv:quant-ph/0204025", doi="10.1070/IM2003v067n01ABEH000422" } @Article{ regev:lattice04, author = "Oded Regev", title = "New lattice based cryptographic constructions", journal = JACM, volume = "51", number = "6", year = "2004", pages = "899--942", note = "Earlier version in STOC '03", doi="10.1145/1039488.1039490" } @Article{ regev:qclattice, author = "Oded Regev", title = "Quantum Computation and Lattice Problems", journal = SIAMJComput, volume = "33", number = "3", year = "2004", pages = "738--760", note = "Earlier version in FOCS '02", doi="10.1137/S0097539703440678" } @Article{ regev:lattice05j, author = "Oded Regev", title = "On lattices, learning with errors, random linear codes, and cryptography", journal = JACM, volume = "56", number = "6", year = "2009", note = "Earlier version in STOC '05", doi="10.1145/1568318.1568324" } @InProceedings{ reichardt:tight, author = "Ben W. Reichardt", title = "Span programs and quantum query complexity: The general adversary bound is nearly tight for every {B}oolean function", booktitle = "Proc. 50th FOCS", publisher="IEEE Comp. Soc. Press", year = "2009", pages = "544--551", doi="10.1109/FOCS.2009.55" } @TechReport{ reichardt:composition, author = "Ben W. Reichardt", title = "Span programs and quantum query algorithms", institution = "ECCC Report TR10--110", year = "2010", eprint="eccc:TR10-110" } @InProceedings{ renner&wolf:new, author = "Renato Renner and Stefan Wolf", title = "New bounds in secret-key agreement: The gap between formation and secrecy extraction", booktitle = "Proc. Advances in Cryptology --- Eurocrypt", series = LectureNotesinComputSci, volume = "2656", publisher = "Springer", pages = "562--577", year = "2003", doi="10.1007/3-540-39200-9\_35" } @Book{ riv, author = "Theodore J. Rivlin", publisher = "Blaisdell Publishing Company", title = "An Introduction to the Approximation of Functions", year = "1969" } @Article{ rivlin&cheney:approx, author = "Theodore J. Rivlin and E. W. Cheney", title = "A Comparison of Uniform Approximations on an Interval and a Finite Subset Thereof", journal = SIAMJNumerAnal, volume = "3", number = "2", pages = "311--320", year = "1966" } @Article{ sen&venkatesh:qcellprobej, author = "Pranab Sen and S. Venkatesh", title = "Lower bounds for predecessor searching in the cell probe model", journal = JComputSystemSci, volume = "74", number = "3", pages = "364--385", year = "2008", doi="10.1016/j.jcss.2007.06.016" } @InProceedings{ sherstov:inclexcl, author = "Alexander A. Sherstov", title = "Approximate inclusion-exclusion for arbitrary symmetric functions", booktitle = "Proc. 23rd IEEE Conf. Comput. Complex.", pages = "112--123", year = "2008", doi="10.1109/CCC.2008.18" } @Article{ sherstov:halfspacej, author = "Alexander A. Sherstov", title = "Halfspace Matrices", journal = CompComplex, volume = "17", number = "2", year = "2008", pages = "149--178", doi = "10.1007/s00037-008-0242-4", bibsource = "DBLP, http://dblp.uni-trier.de" } @Article{ sherstov:patternj, author = "Alexander A. Sherstov", title = "The pattern matrix method", journal = SIAMJComput, year = "2010", note = "To appear. Earlier version in STOC '08" } @Article{ shor:factoring, author = "Peter W. Shor", title = "Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer", journal = SIAMJComput, volume = "26", number = "5", pages = "1484--1509", year = "1997", note = "Earlier versions in FOCS '94 and arxiv:quant-ph/9508027", doi="10.1137/S0097539795293172" } @Article{ simon:power, author = "Daniel R. Simon", title = "On the Power of Quantum Computation", journal = SIAMJComput, volume = "26", number = "5", pages = "1474--1483", year = "1997", note = "Earlier version in FOCS '94", doi="10.1137/S0097539796298637" } @Article{ trevisan:eccsurvey, author = "Luca Trevisan", title = "Some Applications of Coding Theory in Computational Complexity", journal = QuadMat, volume = "13", pages = "347--424", year = "2004" } @Article{ trw:matrixlearning, author = "Koji Tsuda and Gunnar R{\"a}tsch and Manfred Warmuth", title = "Matrix Exponentiated Gradient Updates for On-line Learning and {B}regman Projection", journal = JMachLearnRes, volume = "6", pages = "995--1018", year = "2005", note="\url{http://www.jmlr.org/papers/volume6/tsuda05a/tsuda05a.pdf}" } @InProceedings{ valiant:rigidity, author = "Leslie G. Valiant", title = "Graph-Theoretic Arguments in Low-Level Complexity", booktitle = "Proc. 6th Conf. Math. Found. Comput. Sci. (MFCS)", series = LectureNotesinComputSci, volume = "53", pages = "162--176", publisher = "Springer", year = "1977", doi="10.1007/3-540-08353-7\_135" } @InProceedings{ wehner&wolf:improvedldc, author = "Stephanie Wehner and Ronald de Wolf", title = "Improved Lower Bounds for Locally Decodable Codes and Private Information Retrieval", booktitle = "Proc. 32nd Intern. Colloq. Autom. Lang. Program. (ICALP)", series = LectureNotesinComputSci, volume = "3580", pages = "1424--1436", year = "2005", note = "Earlier version in arxiv:quant-ph/0403140", doi="10.1007/11523468\_115" } @InCollection{ weierstrass, author = "Karl Weierstrass", title = {\"{U}ber die analytische {D}arstellbarkeit sogenannter willk\"{u}rlicher {F}unktionen reeller {A}rgumente}, booktitle = {Sitzungsberichte der K\"{o}niglich Preussischen Akademie der Wissenschaften zu Berlin, II}, volume = "3", year = "1885" } @Article{ wolf:qccsurvey, author = "Ronald de Wolf", title = "Quantum Communication and Complexity", journal = TheoretComputSci, volume = "287", number = "1", pages = "337--353", year = "2002", doi="10.1016/S0304-3975(02)00377-8" } @InProceedings{ wolf:rigidity, author = "Ronald de Wolf", title = "Lower Bounds on Matrix Rigidity Via a Quantum Argument", booktitle = "Proc. 33rd Intern. Colloq. Autom. Lang. Program. (ICALP)", series = LectureNotesinComputSci, volume = "4051", pages = "62--71", year = "2006", note = "Earlier version in arxiv:quant-ph/0505188", doi="10.1007/11786986\_7" } @Article{ wolf:degreesymmf, author = "Ronald de Wolf", title = "A note on quantum algorithms and the minimal degree of {$\varepsilon$}-error polynomials for symmetric functions", journal = QuantumInfComput, volume = "8", number = "10", pages = "943--950", year = "2008", note = "Earlier version in arxiv:quant-ph/0802.1816" } @Unpublished{ wolf:ratdegnote, author = "Ronald de Wolf", title = "Rational degree equals quantum query complexity with postselection", year = "Oct 2008", note = "Unpublished note" } @TechReport{ woodruff:ldclower, author = "David P. Woodruff", title = "New lower bounds for general locally decodable codes", institution = "ECCC Report TR07--006", year = "2007", eprint="eccc:TR07-006" } @InProceedings{ woodruff:3querylower, author = "David P. Woodruff", title = "A Quadratic Lower Bound for Three-Query Linear Locally Decodable Codes over Any Field", booktitle = "Proc. 13th Intern. Workshop Approx. Randomization Comb. Optim. (APPROX)", pages = "766--779", year = "2010", series=LectureNotesinComputSci, publisher="Springer", doi="10.1007/978-3-642-15369-3\_57" } @InProceedings{ yao:distributive, author = "Andrew Chi-Chih Yao", title = "Some Complexity Questions Related to Distributive Computing", booktitle = "Proc. 11th STOC", publisher = "ACM Press", pages = "209--213", year = "1979", doi="10.1145/800135.804414" } @Article{ yekhanin:3ldcj, author = "Sergey Yekhanin", title = "Towards 3-Query Locally Decodable Codes of Subexponential Length", journal = JACM, volume = "55", number = "1", year = "2008", note = "Earlier version in STOC '07", doi="10.1145/1326554.1326555" } @Book{ nielsen&chuang:qc, author = "Michael Nielsen and Isaac L. Chuang", title = "Quantum Computation and Quantum Information", publisher = "Cambridge University Press", year = "2000" } %%%%%%%%%%%%%%%%%%%%%%%%%% %%%%% bib of gs003 %%%%%%%%%%%%%%%%%%%%%%%%%% %% Theory of Computing %% File: gs003.bib %% Publication date: May 15, 2011 %% Authors: Emanuele Viola %% Theory of Computing %% File: gs470.bib %% Publication date: March 31, 2011 %% Authors: Emanuele Viola %% Theory of Computing %% File: gs470.bib %% Publication date: March 31, 2011 %% Authors: Emanuele Viola %%%%%OmniBib.bib @comment{Institute of Electrical and Electronics Engineers. Transactions on Information Theory} @string{IEEETransInformTheory="IEEE Trans. Inform. Theory"} @comment{Journal of Computer and System Sciences} @string{JComputSystemSci="J. Comput. System Sci."} @comment{Acta Arithmetica} @string{ActaArith="Acta Arith."} @comment{Combinatorica. An International Journal on Combinatorics and the Theory of Computing} @string{Combinatorica="Combinatorica"} @comment{Combinatorics, Probability and Computing} @string{CombinProbabComput="Combin. Probab. Comput."} @comment{Journal of the Australian Mathematical Society} @string{JAustMathSoc="J. Aust. Math. Soc."} @comment{London Mathematical Society Lecture Note Series} @string{LondonMathSocLectureNoteSer="London Math. Soc. Lecture Note Ser."} @comment{Duke Mathematical Journal} @string{DukeMathJ="Duke Math. J."} @comment{Geometric and Functional Analysis} @string{GeomFunctAnal="Geom. Funct. Anal."} @comment{Lecture Notes in Computer Science} @string{LectureNotesinComputSci="Lecture Notes in Comput. Sci."} @comment{Electronic Colloquium on Computational Complexity (ECCC)} @string{eccc="Electron. Colloq. on Comput. Complexity (ECCC)"} @string{ACMPUB="ACM Press"} @techreport{ viola-add, author = "Emanuele Viola", title = "Selected Results in Additive Combinatorics: An Exposition", institution=eccc, number=103, year="2007", note = "\url{http://www.eccc.uni-trier.de/report/2007/103/}" } @Article{ bellarechks96, author = "Mihir Bellare and Don Coppersmith and Johan H{\aa}stad and Marcos A. Kiwi and Madhu Sudan", title = "Linearity testing in characteristic two", journal = IEEETransInformTheory, volume = "42", number = "6", year = "1996", pages = "1781--1795", doi="10.1109/18.556674" } @Article{ blumlr93, author = "Manuel Blum and Michael Luby and Ronitt Rubinfeld", title = "Self-Testing/Correcting with Applications to Numerical Problems", journal = JComputSystemSci, volume = "47", number = "3", year = "1993", pages = "549--595", doi="10.1016/0022-0000(93)90044-W" } @Article{ trevisan09-sigact, author = "Luca Trevisan", title = "Additive combinatorics and theoretical computer science", journal = "SIGACT News", volume = "40", number = "2", year = "2009", pages = "50--66", doi="10.1145/1556154.1556170" } @Article{ szemeredi75, author = "Endre Szemer{\'e}di", title = "On sets of integers containing no $k$ elements in arithmetic progression", journal = ActaArith, volume = "27", pages = "199--245", year = "1975", doi="10.1007/BF01894569" } @Article{ bas94, author = "Balog, Antal and Szemer\'{e}di, Endre", title = "A statistical theorem of set addition", journal = Combinatorica, fjournal = "Combinatorica. An International Journal on Combinatorics and the Theory of Computing", volume = "14", year = "1994", number = "3", pages = "263--268", issn = "0209-9683", coden = "COMBDI", mrclass = "11B25 (11B75)", mrnumber = "MR1305895 (95m:11019)", mrreviewer = "Anne Ludington Young", doi="10.1007/BF01212974" } @Book{ fre73, author = "Fre{\u\i}man, Gregory A.", title = "Foundations of a Structural Theory of Set Addition", note = "Translated from the Russian, Translations of Mathematical Monographs, Vol 37", publisher = "American Mathematical Society", year = "1973", pages = "vii+108", mrclass = "10J99 (10AXX)", mrnumber = "MR0360496 (50 \#12944)" } @Article{ greent09-freimanviaextremal, author = "Ben Green and Terence Tao", title = "Freiman's theorem in finite fields via extremal set theory", journal = CombinProbabComput, volume = "18", year = "2009", number = "3", pages = "335--355", doi="10.1017/S0963548309009821" } @Article{ greent09-anote, author = "Ben Green and Terence Tao", title = "A note on the {F}reiman and {B}alog-{S}zemer{\'e}di-{G}owers theorems in finite fields", journal = JAustMathSoc, volume = "86", year = "2009", number = "1", pages = "61--74", doi="10.1017/S1446788708000359" } @incollection{ gre04-finite, author = "Ben Green", title = "Finite field models in additive combinatorics", booktitle = "Surveys in Combinatorics", year = "2005", pages="1--28", number=327, series=LondonMathSocLectureNoteSer, publisher={Cambridge University Press}, doi="10.1017/CBO9780511734885.002" } @Book{ tav06, author = "Tao, Terence and Vu, Van H.", title = "Additive Combinatorics", series = "Cambridge Studies in Advanced Mathematics", volume = "105", publisher = "Cambridge University Press", year = "2006", pages = "xviii+512", isbn = "978-0-521-85386-6; 0-521-85386-9", mrclass = "11-02 (05-02 11P70 11P82 28D05 37A45)", mrnumber = "MR2289012" } @Article{ ruz99, author = "Ruzsa, Imre Z.", title = "An analog of {F}reiman's theorem in groups", journal = "Ast\'erisque", fjournal = "Ast\'erisque", volume = "258", year = "1999", pages = "xv, 323--326", issn = "0303-1179", mrclass = "11P70 (11B25 11B75)", mrnumber = "MR1701207 (2000h:11111)", mrreviewer = "Norbert Hegyv{\'a}ri" } @Article{ kos03, author = "Kostochka, Alexandr and Sudakov, Benny", title = "On {R}amsey numbers of sparse graphs", journal = CombinProbabComput, volume = "12", year = "2003", number = "5-6", pages = "627--641", issn = "0963-5483", mrclass = "05C55", mrnumber = "MR2037075 (2004m:05177)", mrreviewer = "R. H. Schelp", doi="10.1017/S0963548303005728" } @Article{ ssv05, author = "Sudakov, Benny and Szemer{\'e}di, Endre and Vu, Van", title = "On a question of {E}rd{\H o}s and {M}oser", journal = DukeMathJ, fjournal = "Duke Mathematical Journal", volume = "129", year = "2005", number = "1", pages = "129--155", issn = "0012-7094", coden = "DUMJAO", mrclass = "11P70 (05D05 11B75)", mrnumber = "MR2155059 (2006c:11118)", mrreviewer = "Mei Chu Chang", doi="10.1215/S0012-7094-04-12915-X" } @Book{ dup05, author = "Dubhashi, Devdatt P. and Panconesi, Alessandro", title = "Concentration of Measure for the Analysis of Randomized Algorithms", publisher = "Cambridge University Press", year = "2009", pages = "xvi+196", isbn = "978-0-521-88427-3", mrclass = "68W20 (60C05 60F10 68-02 68W40)", mrnumber = "MR2547432" } @InProceedings{ sam07, author = "Alex Samorodnitsky", title = "Low-degree tests at large distances", booktitle = "Proc. 39th STOC", year = "2007", pages = "506--515", publisher = ACMPUB, doi="10.1145/1250790.1250864" } @Article{ gow98, author = "Timothy Gowers", title = "A new proof of {S}zemer\'edi's theorem for arithmetic progressions of length four", journal = GeomFunctAnal, fjournal = "Geometric and Functional Analysis", volume = "8", year = "1998", number = "3", pages = "529--551", issn = "1016-443X", coden = "GFANFB", mrclass = "11B25 (11N13)", mrnumber = "MR1631259 (2000d:11019)", mrreviewer = "D. R. Heath-Brown", doi="10.1007/s000390050065" } @InCollection{ akklr03, author = "Alon, Noga and Kaufman, Tali and Krivelevich, Michael and Litsyn, Simon and Ron, Dana", title = "Testing low-degree polynomials over {${\rm GF}(2)$}", booktitle = "Proc. 7th Intern. Workshop Randomization Approx. Tech. in Comput. Sci. (RANDOM)", series = LectureNotesinComputSci, volume = "2764", pages = "188--199", publisher = "Springer", year = "2003", doi="10.1007/978-3-540-45198-3\_17" } @Book{ coverthomas06, author = "Thomas M. Cover and Joy A. Thomas", title = "Elements of Information Theory", series="Wiley Series in Telecommunications and Signal Processing", year = "2006", isbn = "0471241954", publisher = "Wiley-Interscience" } @Misc{ barvinok-measure2005, author = "Alexander Barvinok", title = "Measure {C}oncentration", year = "2005", note = "Lecture notes. Available at \url{http://www.math.lsa.umich.edu/~barvinok/total710.pdf}" } @Book{Matousek2002, author = {Ji{\v r}{\'\i} Matou{\v s}ek}, title = {Lectures on Discrete Geometry}, year = {2002}, publisher = {Springer-Verlag} } @article{Harper64, author = {L. H. Harper}, title = {Optimal Assignments of Numbers to Vertices}, publisher = {SIAM}, year = {1964}, journal = {SIAM Journal on Applied Mathematics}, volume = {12}, number = {1}, pages = {131-135} } %%%%%%%%%%%%%%%%%%%%%%%%%% %%%%% bib of gs004 %%%%%%%%%%%%%%%%%%%%%%%%%% %% Theory of Computing %% File: gs647.bib %% Publication date: May 33, 2011 %% Authors: Pooya Hatami, Raghav Kulkarni, and Denis Pankratov @comment{Theoretical Computer Science} @string{TheoretComputSci="Theoret. Comput. Sci."} @comment{Combinatorica. An International Journal on Combinatorics and the Theory of Computing} @string{Combinatorica="Combinatorica"} @comment{Information and Computation} @string{InformandComput="Inform. and Comput."} @comment{Computational Complexity} @string{ComputComplexity="Comput. Complexity"} @comment{Journal of Combinatorial Theory. Series A} @string{JCombinTheorySerA="J. Combin. Theory Ser. A"} @comment{Quantum Information & Computation} @string{QuantumInfComput="Quantum Inf. Comput."} @comment{Journal of the ACM} @string{JACM="J. ACM"} @comment{Information Processing Letters} @string{InformProcessLett="Inform. Process. Lett."} @comment{Theory of Computing, Graduate Surveys} @string{TheoryComputGradSurv="Theory Comput. Library, Grad. Surv."} @comment{Journal of Computer and System Sciences} @string{JComputSystemSci="J. Comput. System Sci."} @comment{SIAM Journal on Discrete Mathematics} @string{SIAMJDiscreteMath="SIAM J. Discrete Math."} @string{ACMPUB="ACM Press"} @string{IEEEPUB="IEEE Comp. Soc. Press"} @article{ODonnell11, title={The {Fourier} Entropy-Influence Conjecture for certain classes of {Boolean} functions}, author={O'Donnell, Ryan and Wright, John and Zhou, Yuan}, year={2011}, journal={To appear in ICALP'11}, } @article{Friedgut96, title={Every monotone graph property has a sharp threshold}, volume={124}, url={http://scholar.google.com/scholar?hl=en&btnG=Search&q=intitle:Every+monotone+graph+property+has+a+sharp+threshold#0}, number={10}, journal={Proc. AMS}, publisher={American Mathematical Society}, author={Friedgut, Ehud and Kalai, Gil}, year={1996}, pages={2993--3002}, doi={10.1090/S0002-9939-96-03732-X} } @article{Newman91, author = {Newman, Ilan}, title = {Private vs. common random bits in communication complexity}, journal = InformProcessLett, volume = {39}, issue = {2}, month = {July}, year = {1991}, issn = {0020-0190}, pages = {67--71}, numpages = {5}, url = {http://portal.acm.org/citation.cfm?id=117626.117628}, doi = {10.1016/0020-0190(91)90157-D}, acmid = {117628}, publisher = {Elsevier North-Holland, Inc.}, address = {Amsterdam, The Netherlands, The Netherlands}, keywords = {communication complexity, randomness, theory of computation}, } @Article{ forster02, author = {Forster, J\"{u}rgen}, title = "A linear lower bound on the unbounded error probabilistic communication complexity", journal = JComputSystemSci, volume = "65", issue = "4", month = "December", year = "2002", issn = "0022-0000", pages = "612--625", numpages = "14", url = "http://portal.acm.org/citation.cfm?id=637573.637575", doi = "10.1016/S0022-0000(02)00019-3", acmid = "637575", publisher = "Academic Press, Inc.", address = "Orlando, FL, USA", keywords = "Hadamard matrix, lower bounds, probabilistic communication complexity, spectral norm" } @Article{ kalya92, author = "Kalyanasundaram, Bala and Schintger, Georg", title = "The probabilistic communication complexity of set intersection", journal = SIAMJDiscreteMath, volume = "5", issue = "4", year = "1992", issn = "0895-4801", pages = "545--557", numpages = "13", url = "http://portal.acm.org/citation.cfm?id=140820.140844", doi = "10.1137/0405044", acmid = "140844", publisher = "Society for Industrial and Applied Mathematics", address = "Philadelphia, PA, USA", keywords = "lower bound, nondeterminism, probabilistic communication complexity, set intersection" } @Article{ razborov92, author = "Razborov, Alexander A.", title = "On the distributional complexity of disjointness", journal = TheoretComputSci, volume = "106", issue = "2", year = "1992", issn = "0304-3975", pages = "385--390", numpages = "6", url = "http://dx.doi.org/10.1016/0304-3975(92)90260-M", doi = "10.1016/0304-3975(92)90260-M", acmid = "147049", publisher = "Elsevier Science Publishers Ltd.", address = "Essex, UK" } @Article{ lovasz93, title = "Communication complexity and combinatorial lattice theory", journal = JComputSystemSci, volume = "47", number = "2", pages = "322--349", year = "1993", note = "", issn = "0022-0000", doi = "10.1016/0022-0000(93)90035-U", url = "http://www.sciencedirect.com/science/article/B6WJ0-4B4RP7N-JX/2/bcda54da04067c4bd899f0d4c72bd7da" , author = "L\'{a}szl\'{o} Lov\'{a}sz and Michael Saks" } @InProceedings{ yao79, author = "Yao, Andrew Chi-Chih", title = "Some complexity questions related to distributive computing", booktitle = "Proc. 11th STOC", year = "1979", pages = "209--213", numpages = "5", doi = "10.1145/800135.804414", acmid = "804414", publisher = ACMPUB, address = "New York, NY, USA" } @Article{ beals01, author = "Beals, Robert and Buhrman, Harry and Cleve, Richard and Mosca, Michele and Wolf, Ronald de", title = "Quantum lower bounds by polynomials", journal = JACM, volume = "48", number = "4", year = "2001", issn = "0004-5411", pages = "778--797", publisher = "", doi = "10.1145/502090.502097", address = "New York, NY, USA" } @Article{ nisan92, author = "Noam Nisan and Mario Szegedy", title = "On the Degree of {B}oolean Functions as Real Polynomials", journal = ComputComplexity, year = "1992", volume = "4", doi = "10.1007/BF01263419", pages = "462--467" } @TechReport{ shi02, author = "Yaoyun Shi", title = "Approximating linear restrictions of {B}oolean functions", institution = "Manuscript", year = "2002" } @InProceedings{ chak, author = "Sourav Chakraborty", title = "On the Sensitivity of Cyclically-Invariant {B}oolean Functions", booktitle = "Proc. 20th Ann. IEEE Conf. Comput. Complexity (CCC)", year = "2005", publisher = IEEEPUB, pages = "163--167", doi = "10.1109/CCC.2005.38" } @Article{ gotsman92, author = "Craig Gotsman and Nathan Linial", title = "The Equivalence of Two Problems on the Cube", journal = JCombinTheorySerA, volume = "61", number = "1", year = "1992", pages = "142--146", bibsource = "DBLP, http://dblp.uni-trier.de", doi = "10.1016/0097-3165(92)90060-8" } @Misc{ aaronson2010, author = "Scott Aaronson", title = "The ``sensitivity'' of 2-colorings of the $d$-dimensional integer lattice", month = jul, year = "2010", howpublished = "\url{http://mathoverflow.net/questions/31482/}" } @Article{ kk, author = "Claire Kenyon and Sandy Kutin", title = " Sensitivity, block sensitivity, and $l$-block sensitivity of {B}oolean functions", journal = InformandComput, volume = "189", number = "1", year = "2004", pages = "43", doi = "10.1016/j.ic.2002.12.001" } @Article{ rub, author = "David Rubinstein", title = " Sensitivity vs. block sensitivity of {B}oolean functions", journal = Combinatorica, volume = "15", number = "2", year = "1995", pages = "297--299", doi = "10.1007/BF01200762" } @Article{ sherstov2010equiv, author = "Alexander Sherstov", title = "On Quantum-Classical Equivalence for Composed Communication Problems", journal = QuantumInfComput, volume = "10", number = "5\&6", year = "2010", pages = "435--455" } @InProceedings{ simon, author = "Hans-Ulrich Simon", title = "A tight {$\Omega(\log\log n)$}-bound on the time for parallel {RAM}s to compute non-degenerate {B}oolean functions", booktitle = "Proc. 4th Int. Symp. Fundam. Comput. Theory (FCT)", volume = "158", series = "LNCS", publisher = "Springer", year = "1983", pages = "439--444", bibsource = "" } @Article{ turan, author = {Gy\"orgy Tur\'an}, title = " The critical complexity of graph properties", journal = InformProcessLett, volume = "18", number = "", year = "1984", pages = "151--153", bibsource = "", doi="10.1016/0020-0190(84)90019-X" } @Article{ rv, author = "Ronald L. Rivest and Jean Vuillemin", title = "On recognizing graph properties from adjacency matrices", journal = TheoretComputSci, volume = "3", number = "3", year = "1976", pages = "371--384", bibsource = "", doi = "10.1016/0304-3975(76)90053-0" } @Article{ wolf2008, author = "Wolf, Ronald de", title = "A {B}rief {I}ntroduction to {F}ourier {A}nalysis on the {B}oolean {C}ube", journal = TheoryComputGradSurv, volume = "1", number = "", year = "2008", pages = "", bibsource = "", doi = "10.4086/toc.gs.2008.001" } @Article{ buhrman02, author = "Buhrman, Harry and Wolf, Ronald de", title = "Complexity measures and decision tree complexity: {A} survey", journal = TheoretComputSci, volume = "288", number = "1", year = "2002", issn = "0304-3975", pages = "21--43", doi = "10.1016/S0304-3975(01)00144-X", publisher = "Elsevier Science Publishers Ltd.", address = "Essex, UK" } @Article{ zhang2010, author = "Zhang, Zhiqiang and Shi, Yaoyun", title = "On the parity complexity measures of {B}oolean functions", journal = TheoretComputSci, volume = "411", number = "26--28", year = "2010", issn = "0304-3975", pages = "2612--2618", doi = "10.1016/j.tcs.2010.03.027", publisher = "Elsevier Science Publishers Ltd.", address = "Essex, UK" } @Article{ grolmusz97, author = "Vince Grolmusz", title = "On the Power of Circuits with Gates of Low {L}$_1$ Norms", journal = TheoretComputSci, volume = "188", number = "1--2", year = "1997", pages = "117--128", doi="10.1016/S0304-3975(96)00290-3" } @InProceedings{ nisan89, author = "Noam Nisan", title = "{CREW PRAM}s and decision trees", booktitle = "Proc. 21st STOC", year = "1989", isbn = "0-89791-307-8", pages = "327--335", publisher = ACMPUB, doi = "10.1145/73007.73038", address = "New York, NY, USA" } @InProceedings{ cook82, author = "Cook, Stephen and Dwork, Cynthia", title = "Bounds on the time for parallel {RAM}'s to compute simple functions", booktitle = "Proc. 14th STOC", year = "1982", isbn = "0-89791-070-2", pages = "231--233", doi = "10.1145/800070.802196", publisher = ACMPUB, address = "New York, NY, USA" } @Book{ kushilevitz97, author = "Eyal Kushilevitz and Noam Nisan", title = "Communication Complexity", publisher = "Cambridge University Press", year = "1997" } @InProceedings{ mehlhorn82, author = "Mehlhorn, Kurt and Schmidt, Erik M.", title = "{Las Vegas} is better than determinism in {VLSI} and distributed computing", booktitle = "Proc. 14th STOC", year = "1982", isbn = "0-89791-070-2", pages = "330--337", publisher = ACMPUB, doi = "10.1145/800070.802208", address = "New York, NY, USA" } @Article{ paturi86, title = "Probabilistic communication complexity", journal = JComputSystemSci, volume = "3", number = "1", pages = "106--123", year = "1986", note = "", issn = "0022-0000", doi = "10.1016/0022-0000(86)90046-2", url = "http://www.sciencedirect.com/science/article/B6WJ0-4B4RNBF-F5/2/0abd83c27cdf4b71e9d8e75342a35f59" , author = "Ramamohan Paturi and Janos Simon" } @TechReport{ reischuk82, author = {R\"udiger Reischuk}, title = "A lower time-bound for parallel random access machines without simultaneous writes", number = "RJ3431", institution = "IBM, New York", year = "1982" } @Article{ chung88, author = {Chung, Fan R. K. and F\"{u}redi, Zolt\'{a}n and Graham, Ronald L. and Seymour, Paul}, title = "On induced subgraphs of the cube", journal = JCombinTheorySerA, volume = "49", number = "1", year = "1988", issn = "0097-3165", pages = "180--187", doi = "10.1016/0097-3165(88)90034-9", publisher = "Academic Press, Inc.", address = "Orlando, FL, USA" } @Article{ wolf2002, author = "Wolf, Ronald de", title = "Quantum communication and complexity", journal = TheoretComputSci, volume = "287", year = "2002", number = "1", pages = "337--353", issn = "0304-3975", coden = "TCSDI", mrclass = "81P68 (68Q05 68Q15 68Q25 94A05)", mrnumber = "1944458 (2003i:81053)", mrreviewer = "J{\"o}rg Rothe", doi = "10.1016/S0304-3975(02)00377-8" } @Article{ nisan95, author = "Nisan, Noam and Wigderson, Avi", affiliation = "Institute of Computer Science Hebrew University of Jerusalem Israel", title = "On rank vs. communication complexity", journal = Combinatorica, publisher = "Springer Berlin / Heidelberg", issn = "0209-9683", keyword = "Mathematics and Statistics", pages = "557--565", volume = "15", issue = "4", doi = "10.1007/BF01192527", year = "1995" } @MastersThesis{ chakmaster, author = "Sourav Chakraborty", title = "Sensitivity, Block Sensitivity and Certificate Complexity of {B}oolean Functions", school = "University of Chicago", address = "USA", year = "2005" } @Article{ bublitz86, title = "Properties of complexity measures for {PRAM}s and {WRAM}s", journal = TheoretComputSci, volume = "48", number = "1", pages = "53--73", year = "1986", note = "", issn = "0304-3975", doi = "10.1016/0304-3975(86)90083-6", url = "http://www.sciencedirect.com/science/article/B6V1G-48CX42J-2B/2/b5cecd39ffe429e44279d8cd2e47f787" , author = {Siegfried Bublitz and Ute Sch\"{u}rfeld and Ingo Wegener and Bernd Voigt} } @InProceedings{ aaronson03, author = "Scott Aaronson", title = "Quantum Certificate Complexity", booktitle = "Proc. 18th IEEE Conf. Comp. Compl. (CCC)", publisher = IEEEPUB, year = "2003", pages = "171--178", doi="10.1109/CCC.2003.1214418" } @techreport{ midrijanis04, author = "Gatis Midrijanis", title = "Exact quantum query complexity for total {B}oolean functions", year = "2004", institution = {Cornell University ArXiv.org}, eprint = {arxiv:quant-ph/0403168} } @InProceedings{ blum87, author = "Manuel Blum and Russell Impagliazzo", title = "Generic oracles and oracle classes", booktitle = "Proc. 28th FOCS", year = "1987", publisher = IEEEPUB, pages = "118--126", doi="10.1109/SFCS.1987.30" } @InProceedings{ hartmanis87, author = "Juris Hartmanis and Lane A. Hemachandra", title = "One-way functions, robustness and the non-isomorphism of {NP}-complete sets", booktitle = "Proc. 2nd IEEE Struct. Complex. Theory Conf.", publisher = IEEEPUB, year = "1987", pages = "160--174" } @Article{ tardos89, author = "G\'abor Tardos", title = "{Query complexity, or why is it difficult to separate $NP^A \cap coNP^A$ from $P^A$ by random oracles $A$?}", journal = Combinatorica, publisher = "Springer Berlin / Heidelberg", issn = "0209-9683", keyword = "Mathematics and Statistics", pages = "385--392", volume = "9", issue = "4", doi = "10.1007/BF02125350", year = "1989" } %%%%%%%%%%%%%%%%%%%%%%%%%% %%%%% bib of v001a001 %%%%%%%%%%%%%%%%%%%%%%%%%% @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} } %%%%%%%%%%%%%%%%%%%%%%%%%% %%%%% bib of v001a002 %%%%%%%%%%%%%%%%%%%%%%%%%% % 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} } %%%%%%%%%%%%%%%%%%%%%%%%%% %%%%% bib of v001a003 %%%%%%%%%%%%%%%%%%%%%%%%%% @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} } %%%%%%%%%%%%%%%%%%%%%%%%%% %%%%% bib of v001a004 %%%%%%%%%%%%%%%%%%%%%%%%%% @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} } %%%%%%%%%%%%%%%%%%%%%%%%%% %%%%% bib of v001a005 %%%%%%%%%%%%%%%%%%%%%%%%%% @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 } %%%%%%%%%%%%%%%%%%%%%%%%%% %%%%% bib of v001a006 %%%%%%%%%%%%%%%%%%%%%%%%%% @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"} %%%%%%%%%%%%%%%%%%%%%%%%%% %%%%% bib of v001a007 %%%%%%%%%%%%%%%%%%%%%%%%%% % 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} } %%%%%%%%%%%%%%%%%%%%%%%%%% %%%%% bib of v001a008 %%%%%%%%%%%%%%%%%%%%%%%%%% %% 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} } %%%%%%%%%%%%%%%%%%%%%%%%%% %%%%% bib of v001a009 %%%%%%%%%%%%%%%%%%%%%%%%%% %% 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, } %%%%%%%%%%%%%%%%%%%%%%%%%% %%%%% bib of v002a001 %%%%%%%%%%%%%%%%%%%%%%%%%% @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" ) %%%%%%%%%%%%%%%%%%%%%%%%%% %%%%% bib of v002a002 %%%%%%%%%%%%%%%%%%%%%%%%%% %% 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", } %%%%%%%%%%%%%%%%%%%%%%%%%% %%%%% bib of v002a003 %%%%%%%%%%%%%%%%%%%%%%%%%% %% 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}, } %%%%%%%%%%%%%%%%%%%%%%%%%% %%%%% bib of v002a004 %%%%%%%%%%%%%%%%%%%%%%%%%% %% 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} } %%%%%%%%%%%%%%%%%%%%%%%%%% %%%%% bib of v002a005 %%%%%%%%%%%%%%%%%%%%%%%%%% %% 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} } %%%%%%%%%%%%%%%%%%%%%%%%%% %%%%% bib of v002a006 %%%%%%%%%%%%%%%%%%%%%%%%%% %% 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" } %%%%%%%%%%%%%%%%%%%%%%%%%% %%%%% bib of v002a007 %%%%%%%%%%%%%%%%%%%%%%%%%% %% 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" } %%%%%%%%%%%%%%%%%%%%%%%%%% %%%%% bib of v002a008 %%%%%%%%%%%%%%%%%%%%%%%%%% %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% %% 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" } %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% %%%%%%%%%%%%%%%%%%%%%%%%%% %%%%% bib of v002a009 %%%%%%%%%%%%%%%%%%%%%%%%%% %% 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"} %%%%%%%%%%%%%%%%%%%%%%%%%% %%%%% bib of v002a010 %%%%%%%%%%%%%%%%%%%%%%%%%% 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}, } %%%%%%%%%%%%%%%%%%%%%%%%%% %%%%% bib of v002a011 %%%%%%%%%%%%%%%%%%%%%%%%%% %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% %% 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", } %%%%%%%%%%%%%%%%%%%%%%%%%% %%%%% bib of v002a012 %%%%%%%%%%%%%%%%%%%%%%%%%% %% 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"} %%%%%%%%%%%%%%%%%%%%%%%%%% %%%%% bib of v002a013 %%%%%%%%%%%%%%%%%%%%%%%%%% %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% %% 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" ) %%%%%%%%%%%%%%%%%%%%%%%%%% %%%%% bib of v003a001 %%%%%%%%%%%%%%%%%%%%%%%%%% @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 } %%%%%%%%%%%%%%%%%%%%%%%%%% %%%%% bib of v003a002 %%%%%%%%%%%%%%%%%%%%%%%%%% @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" } %%%%%%%%%%%%%%%%%%%%%%%%%% %%%%% bib of v003a003 %%%%%%%%%%%%%%%%%%%%%%%%%% @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 } %%%%%%%%%%%%%%%%%%%%%%%%%% %%%%% bib of v003a004 %%%%%%%%%%%%%%%%%%%%%%%%%% @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" } %%%%%%%%%%%%%%%%%%%%%%%%%% %%%%% bib of v003a005 %%%%%%%%%%%%%%%%%%%%%%%%%% @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 } %%%%%%%%%%%%%%%%%%%%%%%%%% %%%%% bib of v003a006 %%%%%%%%%%%%%%%%%%%%%%%%%% @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"} %%%%%%%%%%%%%%%%%%%%%%%%%% %%%%% bib of v003a007 %%%%%%%%%%%%%%%%%%%%%%%%%% %% 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" } %%%%%%%%%%%%%%%%%%%%%%%%%% %%%%% bib of v003a008 %%%%%%%%%%%%%%%%%%%%%%%%%% %% 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"} %%%%%%%%%%%%%%%%%%%%%%%%%% %%%%% bib of v003a009 %%%%%%%%%%%%%%%%%%%%%%%%%% %% 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 ) %%%%%%%%%%%%%%%%%%%%%%%%%% %%%%% bib of v003a010 %%%%%%%%%%%%%%%%%%%%%%%%%% %% 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" } %%%%%%%%%%%%%%%%%%%%%%%%%% %%%%% bib of v003a011 %%%%%%%%%%%%%%%%%%%%%%%%%% %%% 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} %%%%%%%%%%%%%%%%%%%%%%%%%% %%%%% bib of v003a012 %%%%%%%%%%%%%%%%%%%%%%%%%% %% 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" } %%%%%%%%%%%%%%%%%%%%%%%%%% %%%%% bib of v004a001 %%%%%%%%%%%%%%%%%%%%%%%%%% %% 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" } %%%%%%%%%%%%%%%%%%%%%%%%%% %%%%% bib of v004a002 %%%%%%%%%%%%%%%%%%%%%%%%%% %% 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" } %%%%%%%%%%%%%%%%%%%%%%%%%% %%%%% bib of v004a003 %%%%%%%%%%%%%%%%%%%%%%%%%% %% 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} } %%%%%%%%%%%%%%%%%%%%%%%%%% %%%%% bib of v004a004 %%%%%%%%%%%%%%%%%%%%%%%%%% %% 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-- %%%%%%%%%%%%%%%%%%%%%%%%%% %%%%% bib of v004a005 %%%%%%%%%%%%%%%%%%%%%%%%%% %%%%%%%%%%%%%%%%%%%%%%%%%% %%%%% bib of v004a006 %%%%%%%%%%%%%%%%%%%%%%%%%% %% 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"} %%%%%%%%%%%%%%%%%%%%%%%%%% %%%%% bib of v004a007 %%%%%%%%%%%%%%%%%%%%%%%%%% %% 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}, } %%%%%%%%%%%%%%%%%%%%%%%%%% %%%%% bib of v004a008 %%%%%%%%%%%%%%%%%%%%%%%%%% %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} } %%%%%%%%%%%%%%%%%%%%%%%%%% %%%%% bib of v004a009 %%%%%%%%%%%%%%%%%%%%%%%%%% @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}, } %%%%%%%%%%%%%%%%%%%%%%%%%% %%%%% bib of v005a001 %%%%%%%%%%%%%%%%%%%%%%%%%% %% 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}} %%%%%%%%%%%%%%%%%%%%%%%%%% %%%%% bib of v005a002 %%%%%%%%%%%%%%%%%%%%%%%%%% %% 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}} %%%%%%%%%%%%%%%%%%%%%%%%%% %%%%% bib of v005a003 %%%%%%%%%%%%%%%%%%%%%%%%%% %% 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}} %%%%%%%%%%%%%%%%%%%%%%%%%% %%%%% bib of v005a004 %%%%%%%%%%%%%%%%%%%%%%%%%% % 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}} %%%%%%%%%%%%%%%%%%%%%%%%%% %%%%% bib of v005a005 %%%%%%%%%%%%%%%%%%%%%%%%%% %% This BibTeX bibliography file was created using BibDesk. %% http://bibdesk.sourceforge.net/ %% Created for Alexander Russell at 2009-05-15 16:48:19 -0400 %% Saved with string encoding Unicode (UTF-8) @inproceedings{ACRSZ07, Author = {A. Ambainis and A. M. Childs and B. W. Reichardt and R. {\v S}palek and S. Zhang}, Booktitle = {Proc. 48th IEEE FOCS}, Date-Modified = {2009-05-15 15:58:39 -0400}, Doi = {10.1109/FOCS.2007.57}, Eprint = {arXiv:quant-ph/0703015, arXiv:0704.3628}, Publisher = {IEEE Comp. Soc. Press}, Pages = {363--372}, Title = {Any {AND-OR} formula of size {$N$} can be evaluated in time {$N^{1/2 + o(1)}$} on a quantum computer}, Year = {2007}} @article{BS04, Author = {H. Barnum and M. Saks}, Date-Modified = {2009-05-15 16:02:30 -0400}, Doi = {10.1016/j.jcss.2004.02.002 }, Eprint = {arXiv:quant-ph/0201007}, Journal = {J. Comput. System Sci.}, Number = {2}, Pages = {244--258}, Title = {A lower bound on the quantum query complexity of read-once functions}, Volume = {69}, Year = {2004}} @article{BACS05, Author = {D. W. Berry and G. Ahokas and R. Cleve and B. C. Sanders}, Date-Modified = {2009-05-15 16:05:10 -0400}, Doi = {10.1007/s00220-006-0150-x}, Eprint = {arXiv:quant-ph/0508139}, Journal = {Comm. Math. Phys.}, Number = {2}, Pages = {359--371}, Title = {Efficient quantum algorithms for simulating sparse {Hamiltonians}}, Volume = {270}, Year = {2007}} @phdthesis{Chi04, Author = {A. M. Childs}, School = {Massachusetts Institute of Technology}, Title = {Quantum information processing in continuous time}, Year = {2004}} @article{FGG07, Author = {E. Farhi and J. Goldstone and S. Gutmann}, Date-Modified = {2009-05-15 15:55:36 -0400}, Doi = {10.4086/toc.2008.v004a008}, Journal = {Theory of Computing}, Number = {1}, Pages = {169--190}, Title = {A quantum algorithm for the {Hamiltonian} {NAND} tree}, Volume = {4}, Year = {2008}} @article{FG98, Author = {E. Farhi and S. Gutmann}, Date-Modified = {2009-05-15 16:06:07 -0400}, Doi = {10.1103/PhysRevA.58.915 }, Eprint = {arXiv:quant-ph/9706062}, Journal = {Phys. Rev. A}, Pages = {915--928}, Title = {Quantum computation and decision trees}, Volume = {58}, Year = {1998}} @article{Moc06, Author = {C. Mochon}, Date-Modified = {2009-05-15 16:07:10 -0400}, Doi = {10.1103/PhysRevA.75.042313}, Eprint = {arXiv:quant-ph/0602032}, Journal = {Phys. Rev. A}, Number = {4}, Pages = {042313}, Title = {Hamiltonian oracles}, Volume = {75}, Year = {2007}} @inproceedings{SW86, Author = {M. Saks and A. Wigderson}, Booktitle = {Proc. 27th FOCS}, Date-Modified = {2009-05-15 15:51:27 -0400}, Pages = {29--38}, Publisher = {IEEE Comp. Soc. Press}, Title = {Probabilistic {Boolean} decision trees and the complexity of evaluating game trees}, Year = {1986}} @article{San95, Author = {M. Santha}, Date-Modified = {2009-05-15 16:11:42 -0400}, Doi = {10.1002/rsa.3240060108}, Journal = {Random Structures Algorithms}, Number = {1}, Pages = {75--87}, Title = {On the {Monte} {Carlo} {Boolean} decision tree complexity of read-once formulae}, Volume = {6}, Year = {1995}} @article{Sni85, Author = {M. Snir}, Date-Modified = {2009-05-15 16:10:03 -0400}, Doi = {10.1016/0304-3975(85)90210-5}, Journal = {Theoret. Comput. Sci.}, Pages = {69--82}, Title = {Lower bounds on probabilistic linear decision trees}, Volume = {38}, Year = {1985}} @TechReport{original, author = {Andrew M. Childs and Richard Cleve and Stephen P. Jordan and David Yeung}, title = {Discrete-query quantum algorithm for {NAND} trees}, institution = {Arxiv.org}, year = {2007}, eprint = {arxiv:quant-ph/0702160}, OPTkey = {}, OPTtype = {}, OPTnumber = {}, OPTaddress = {}, OPTmonth = {}, OPTnote = {}, OPTannote = {} } %%%%%%%%%%%%%%%%%%%%%%%%%% %%%%% bib of v005a006 %%%%%%%%%%%%%%%%%%%%%%%%%% %% ToC#380 newman - rabinovich %% au 2009-06-16 LB 06-26 ACR 06-30 %% This BibTeX bibliography file was created using BibDesk. %% http://bibdesk.sourceforge.net/ %% Created for Alexander Russell at 2009-06-30 15:04:51 -0400 @book{deza, Author = {M. M. Deza and M. Laurent}, Publisher = {Springer Verlag}, Title = {Geometry of Cuts and Metrics}, Year = {1997}} @book{MS, Author = {F. J. MacWilliams and {N. J. A.} Sloane}, Publisher = {North Holland}, Title = {The Theory of Error-Correcting Codes}, Year = {1977}} @inproceedings{ALN, Author = {S. Arora and J. R. Lee and A. Naor}, Booktitle = {Proc. 37th STOC}, Eprint = {stoc:1060590.1060673}, Pages = {553--562}, Publisher = {ACM Press}, Title = {Euclidean distortion and the sparsest cut}, Year = {2005}} @article{AR, Author = {N. Alon and Y. Roichman}, doi = {10.1002/rsa.3240050203}, Journal = {Random Structures Algorithms}, Number = {2}, Pages = {271--284}, Title = {Random {Cayley} graphs and expanders}, Volume = {5}, Year = {1994}} @article{AuRa, Author = {Y. Aumann and Y. Rabani}, Doi = {10.1137/S0097539794285983}, Journal = {SIAM J. Comput.}, Number = {1}, Pages = {291--301}, Title = {An {$O(\log k)$} approximate min-cut max-flow theorem and approximation algorithm}, Volume = {27}, Year = {1998}} @article{Bour, Author = {J. Bourgain}, Journal = {Israel J. Math.}, Number = {1-2}, Pages = {46--52}, Title = {On {Lipschitz} embeddings of finite metric spaces in {Hilbert} Space}, Volume = {52}, Year = {1985}} @article{CGR, Author = {S. Chawla and A. Gupta and H. {R\"acke}}, Doi = {10.1145/1361192.1361199}, Journal = {ACM Trans. Algorithms}, Number = {2}, Pages = {1--18}, Title = {Embeddings of negative-type metrics and an improved approximation to generalized sparsest cut}, Volume = {4}, Year = {2008}} @inproceedings{GKL, Author = {A. Gupta and R. Krauthgamer and J. R. Lee}, Booktitle = {Proc. 44th FOCS}, Pages = {534--543}, Publisher = {IEEE Comp. Soc. Press}, Title = {Bounded Geometries, Fractals, and Low-Distortion Embeddings}, Year = {2003}} @article{LW, Author = {S. Hoory and N. Linial and A. Wigderson}, Doi = {10.1090/S0273-0979-06-01126-8}, Journal = {Bull. Amer. Math. Soc.}, Number = {4}, Pages = {439-561}, Title = {Expander Graphs and Their Applications}, Volume = {43}, Year = {2006}, Bdsk-Url-1 = {http://dx.doi.org/10.1090/S0273-0979-06-01126-8}} @article{J, Author = {J. Justesen}, Date-Modified = {2009-06-30 13:51:06 -0400}, Journal = {IEEE Trans. Inform. Theory}, Number = {5}, Pages = {652--656}, Title = {A class of constructive asymptotically good algebraic codes}, Volume = {18}, Year = {1972}} @inproceedings{KN, Author = {S. Khot and A. Naor}, Booktitle = {Proc. 46th FOCS}, Doi = {10.1109/SFCS.2005.61}, Pages = {101--112}, Publisher = {IEEE Comp. Soc. Press}, Title = {Nonembeddability theorems via {Fourier} analysis}, Year = {2005}} @article{LLR, Author = {N. Linial and E. London and Y. Rabinovich}, Doi = {10.1007/BF01200757}, Journal = {Combinatorica}, Number = {2}, Pages = {215--245}, Title = {The geometry of graphs and some of its algorithmic applications}, Volume = {15}, Year = {1995}} @article{Ma1, Author = {J. {Matou\v{s}ek}}, Journal = {Israel J. Math.}, Pages = {221--237}, Title = {On embedding trees into uniformly convex {Banach} spaces}, Volume = {114}, Year = {1999}} @book{Ma, Author = {J. {Matou\v{s}ek}}, Publisher = {Springer}, Title = {Lectures on Discrete Geometry}, Year = {2002}} @inproceedings{Rao, Author = {S. Rao}, Booktitle = {Proc. 15th Ann. Symp. on Comput. Geometry (SoCG'99)}, Doi = {10.1145/304893.304983}, Isbn = {1-58113-068-6}, Pages = {300--306}, Publisher = {ACM Press}, Title = {Small distortion and volume preserving embeddings for planar and {Euclidean} metrics}, Year = {1999}} @article{WX, Author = {Avi Wigderson and David Xiao}, Doi = {10.4086/toc.2008.v004a003}, Journal = {Theory of Computing}, Number = {1}, Pages = {53--76}, Title = {Derandomizing the {Ahlswede}-{Winter} matrix-valued {Chernoff} bound using pessimistic estimators, and applications}, Volume = {4}, Year = {2008}} %%%%%%%%%%%%%%%%%%%%%%%%%% %%%%% bib of v005a007 %%%%%%%%%%%%%%%%%%%%%%%%%% % ToC#467 Fortnow note % BibTeX bibliography file % au: 2009-06-16 % DB: 2009-06-29 @Misc{Aaronson-zoo, author = {S. Aaronson}, title = {The Complexity Zoo}, note = {http://complexityzoo.com} } @Book{Arora-Barak, author = {S. Arora and B. Barak}, title = {Complexity Theory: {A} Modern Approach}, year = {2009}, publisher = {Cambridge University Press}, address = {Cambridge} } @InCollection{F-counting, author = {L. Fortnow}, title = {Counting Complexity}, booktitle = {Complexity Theory Retrospective II}, editor = {L. Hemaspaandra and A. Selman}, year = {1997}, pages = {81--107}, publisher = {Springer} } @comment{Journal of Computer and System Sciences} @string{JComputSystemSci="J. Comput. System Sci."} @Article{FFK, author = {Fenner, S. and L. Fortnow and S. Kurtz}, title = {Gap-Definable Counting Classes}, journal = JComputSystemSci, year = {1994}, volume = {48}, number = {1}, pages = {116--148}, doi={10.1016/S0022-0000(05)80024-8} } @InCollection{PZ, author = {C. Papadimitriou and S. Zachos}, title = {Two Remarks on the power of counting}, booktitle = {Proc. 6th GI-Conf. Theor. Comput. Sci.}, year = {1983}, series = {LNCS}, volume = {145}, pages = {269--276}, publisher = {Springer}, address = {Berlin}, doi={10.1007/BFb0009651} } @comment{Theoretical Computer Science} @string{TheoretComputSci="Theoret. Comput. Sci."} @Article{VV, author = {L. Valiant and V. Vazirani}, title = {{NP} is as easy as detecting unique solutions}, journal = TheoretComputSci, year = {1986}, volume = {47}, pages = {85--93}, doi={10.1016/0304-3975(86)90135-0} } @Article{Zachos, author = {S. Zachos}, title = {Probabilistic quantifiers and games}, journal = JComputSystemSci, year = {1988}, volume = {36}, number=3, pages = {433--451}, doi={10.1016/0022-0000(88)90037-2} } @Article{blog-toda, author = {L. Fortnow}, title = {Making Pigs Fly}, journal = {Computational Complexity Weblog}, year = {2006}, month = {June}, note = {http://weblog.fortnow.com/2005/06/making-pigs-fly.html} } @comment{SIAM Journal on Computing} @string{SIAMJComput="SIAM J. Comput."} @Article{toda, author = {S. Toda}, title = {{PP} is as hard as the polynomial-time hierarchy}, journal = SIAMJComput, year = {1991}, volume = {20}, number = {5}, pages = {865--877}, doi={10.1137/0220053} } %%%%%%%%%%%%%%%%%%%%%%%%%% %%%%% bib of v005a008 %%%%%%%%%%%%%%%%%%%%%%%%%% %% ToC#395.bib Holenstein %% v005a008 2009.07.29 @comment{Journal of Complexity} @comment{Foundations of Physics. An International Journal Devoted to the Conceptual Bases and Fundamental Theories of Modern Physics, Biophysics, and Cosmology} @comment{Journal of the American Statistical Association} @comment{Random Structures & Algorithms} @comment{Physical Review Letters} @comment{Institute of Electrical and Electronics Engineers. Transactions on Information Theory} @comment{Letters in Mathematical Physics. A Journal for the Rapid Dissemination of Short Contributions in the Field of Mathematical Physics} @comment{SIAM Journal on Applied Mathematics} @comment{Computational Complexity} @string{cacm = {Comm. ACM}} @string{compcomplex = {Comput. Complexity}} @string{crypto00 = {Advances in Cryptology --- CRYPTO~2000}} @string{crypto01 = {Advances in Cryptology --- CRYPTO~2001}} @string{crypto02 = {Advances in Cryptology --- CRYPTO~2002}} @string{crypto03 = {Advances in Cryptology --- CRYPTO~2003}} @string{crypto04 = {Advances in Cryptology --- CRYPTO~2004}} @string{crypto05 = {Advances in Cryptology --- CRYPTO~2005}} @string{crypto91 = {Advances in Cryptology --- CRYPTO~'91}} @string{crypto92 = {Advances in Cryptology --- CRYPTO~'92}} @string{crypto93 = {Advances in Cryptology --- CRYPTO~'93}} @string{crypto94 = {Advances in Cryptology --- CRYPTO~'94}} @string{crypto95 = {Advances in Cryptology --- CRYPTO~'95}} @string{crypto96 = {Advances in Cryptology --- CRYPTO~'96}} @string{crypto97 = {Advances in Cryptology --- CRYPTO~'97}} @string{crypto98 = {Advances in Cryptology --- CRYPTO~'98}} @string{crypto99 = {Advances in Cryptology --- CRYPTO~'99}} @string{ec00 = {Advances in Cryptology --- EUROCRYPT~2000}} @string{ec01 = {Advances in Cryptology --- EUROCRYPT~2001}} @string{ec02 = {Advances in Cryptology --- EUROCRYPT~2002}} @string{ec03 = {Advances in Cryptology --- EUROCRYPT~2003}} @string{ec04 = {Advances in Cryptology --- EUROCRYPT~2004}} @string{ec05 = {Advances in Cryptology --- EUROCRYPT~2005}} @string{ec06 = {Advances in Cryptology --- EUROCRYPT~2006}} @string{ec07 = {Advances in Cryptology --- EUROCRYPT~2007}} @string{ec08 = {Advances in Cryptology --- EUROCRYPT~2008}} @string{ec93 = {Advances in Cryptology --- EUROCRYPT~'93}} @string{ec94 = {Advances in Cryptology --- EUROCRYPT~'94}} @string{ec95 = {Advances in Cryptology --- EUROCRYPT~'95}} @string{ec96 = {Advances in Cryptology --- EUROCRYPT~'96}} @string{ec97 = {Advances in Cryptology --- EUROCRYPT~'97}} @string{ec98 = {Advances in Cryptology --- EUROCRYPT~'98}} @string{ec99 = {Advances in Cryptology --- EUROCRYPT~'99}} @string{eccc = {Electron. Colloq. Comput. Complexity (ECCC)}} @string{focs = {FOCS}} @string{FOCS = {FOCS}} @string{focs00 = {Proc. 41st } # FOCS} @string{focs01 = {Proc. 42nd } # FOCS} @string{focs02 = {Proc. 43rd } # FOCS} @string{focs03 = {Proc. 44th } # FOCS} @string{focs04 = {Proc. 45th } # FOCS} @string{focs05 = {Proc. 46th } # FOCS} @string{focs06 = {Proc. 47th } # FOCS} @string{focs07 = {Proc. 48th } # FOCS} @string{focs08 = {Proc. 49th } # FOCS} @string{focs82 = {Proc. 23rd } # FOCS} @string{focs83 = {Proc. 24th } # FOCS} @string{focs84 = {Proc. 25th } # FOCS} @string{focs85 = {Proc. 26th } # FOCS} @string{focs86 = {Proc. 27th } # FOCS} @string{focs87 = {Proc. 28th } # FOCS} @string{focs88 = {Proc. 29th } # FOCS} @string{focs89 = {Proc. 30th } # FOCS} @string{focs90 = {Proc. 31st } # FOCS} @string{focs91 = {Proc. 32nd } # FOCS} @string{focs92 = {Proc. 33rd } # FOCS} @string{focs93 = {Proc. 34th } # FOCS} @string{focs94 = {Proc. 35th } # FOCS} @string{focs95 = {Proc. 36th } # FOCS} @string{focs96 = {Proc. 37th } # FOCS} @string{focs97 = {Proc. 38th } # FOCS} @string{focs98 = {Proc. 39th } # FOCS} @string{focs99 = {Proc. 40th } # FOCS} @string{foundphys = {Found. Phys.}} @string{ieeetransinformtheory = {IEEE Trans. Inform. Theory}} @string{jacm = {J. {ACM}}} @string{jamerstatistassoc = {J. Amer. Statist. Assoc.}} @string{jcomplexity = {J. Complexity}} @string{jcss = {J. Computer and System Sciences}} @string{joc = {J. Cryptology}} @string{lettmathphys = {Lett. Math. Phys.}} @string{lncs = {Lecture Notes in Computer Science}} @string{physrevlett = {Phys. Rev. Lett.}} @string{randomstructuresalgorithms = {Random Structures Algorithms}} @string{siamcomp = {{SIAM} J. Comput.}} @string{siamdisc = {{SIAM} J. Discrete Math.}} @string{siamjapplmath = {SIAM J. Appl. Math.}} @string{stacs02 = {Proc. 19th Intern. Symp. Theor. Aspects of Comput. Sci. (STACS)}} @string{STOCOpen = {Proc.}} @string{STOCClose = {STOC}} @string{stoc00 = STOCOpen # { 32nd } # STOCClose} @string{stoc01 = STOCOpen # { 33rd } # STOCClose} @string{stoc02 = STOCOpen # { 34th } # STOCClose} @string{stoc03 = STOCOpen # { 35th } # STOCClose} @string{stoc04 = STOCOpen # { 36th } # STOCClose} @string{stoc05 = STOCOpen # { 37th } # STOCClose} @string{stoc06 = STOCOpen # { 38th } # STOCClose} @string{stoc07 = STOCOpen # { 39th } # STOCClose} @string{stoc08 = STOCOpen # { 40th } # STOCClose} @string{stoc88 = STOCOpen # { 20th } # STOCClose} @string{stoc89 = STOCOpen # { 21st } # STOCClose} @string{stoc90 = STOCOpen # { 22nd } # STOCClose} @string{stoc91 = STOCOpen # { 23rd } # STOCClose} @string{stoc92 = STOCOpen # { 24th } # STOCClose} @string{stoc93 = STOCOpen # { 25th } # STOCClose} @string{stoc94 = STOCOpen # { 26th } # STOCClose} @string{stoc95 = STOCOpen # { 27th } # STOCClose} @string{stoc96 = STOCOpen # { 28th } # STOCClose} @string{stoc97 = STOCOpen # { 29th } # STOCClose} @string{stoc98 = STOCOpen # { 30th } # STOCClose} @string{stoc99 = STOCOpen # { 31st } # STOCClose} @string{stocclose = {STOC}} @string{stocopen = {Proc.}} @inproceedings{AroSaf92, Author = {Sanjeev Arora and Shmuel Safra}, Booktitle = FOCS92, Date-Modified = {2009-07-28 14:32:22 -0400}, Doi = {10.1109/SFCS.1992.267824}, Pages = {2--13}, Publisher = {IEEE Comp. Soc. Press}, Title = {Probabilistic Checking of Proofs; A New Characterization of {NP}}, Year = {1992}, Bdsk-Url-1 = {http://dx.doi.org/10.1109/SFCS.1992.267824}} @inproceedings{ALMSS92, Author = {Sanjeev Arora and Carsten Lund and Rajeev Motwani and Madhu Sudan and Mario Szegedy}, Booktitle = FOCS92, Date-Modified = {2009-07-28 14:31:30 -0400}, Doi = {10.1109/SFCS.1992.267823}, Pages = {14--23}, Publisher = {IEEE Comp. Soc. Press}, Title = {Proof Verification and Hardness of Approximation Problems}, Year = {1992}, Bdsk-Url-1 = {http://dx.doi.org/10.1109/SFCS.1992.267823}} @inproceedings{BHHRRS08, Author = {Boaz Barak and Moritz Hardt and Ishay Haviv and Anup Rao and Oded Regev and David Steurer}, Booktitle = FOCS08, Date-Modified = {2009-07-01 16:01:18 -0400}, Doi = {10.1109/FOCS.2008.31}, Pages = {374--383}, Publisher = {IEEE Comp. Soc. Press}, Title = {Rounding Parallel Repetition of Unique Games}, Year = 2008, Bdsk-Url-1 = {http://dx.doi.org/10.1109/FOCS.2008.31}} @inproceedings{BGKW88, Author = {Michael Ben-Or and Shafi Goldwasser and Joe Kilian and Avi Wigderson}, Booktitle = STOC88, Date-Modified = {2009-07-01 16:04:11 -0400}, Doi = {10.1145/62212.62223}, Pages = {113--132}, Publisher = {ACM Press}, Title = {Multi-Prover Interactive Proofs: How to Remove Intractability Assumptions}, Year = 1988, Bdsk-Url-1 = {http://dx.doi.org/10.1145/62212.62223}} @article{BrBrTa05, Author = {Gilles Brassard and Anne Broadbent and Alain Tapp}, Date-Modified = {2009-07-29 09:57:14 -0400}, Doi = {10.1007/s10701-005-7353-4}, Eprint = {arxiv:quant-ph/0407221}, Journal = {Foundations of Physics}, Number = {11}, Pages = {1877--1907}, Title = {Quantum Pseudo-Telepathy}, Volume = {35}, Year = 2005, Bdsk-Url-1 = {http://dx.doi.org/10.1007/s10701-005-7353-4}} @article{BGMZ97, Author = {Andrei Z. Broder and Steven C. Glassman and Mark S. Manasse and Geoffrey Zweig}, Journal = {Computer Networks}, Number = {8--13}, Pages = {1157-1166}, Title = {Syntactic Clustering of the Web}, Volume = {29}, Year = {1997}} @article{CaCoLi92, Author = {{Jin-yi} Cai and Anne Condon and Richard J.~Lipton}, Doi = {10.1016/0304-3975(92)90085-T}, Journal = {Theoretical Computer Science}, Number = 1, Pages = {25--38}, Title = {On games of incomplete information}, Volume = 103, Year = 1992, Bdsk-Url-1 = {http://dx.doi.org/10.1016/0304-3975(92)90085-T}} @article{Cirels80, Author = {Boris S. Cirel'son}, Doi = {10.1007/BF00417500}, Journal = LettMathPhys, Number = 2, Pages = {93--100}, Title = {Quantum Generalizations of {B}ell's Inequality}, Volume = 4, Year = 1980, Bdsk-Url-1 = {http://dx.doi.org/10.1007/BF00417500}} @article{CSUU08, Author = {Richard Cleve and William Slofstra and Falk Unger and Sarvagya Upadhyay}, Doi = {10.1007/s00037-008-0250-4}, Journal = {Computational Complexity}, Number = {2}, Pages = {282--299}, Title = {Perfect Parallel Repetition Theorem for Quantum {XOR} Proof Systems}, Volume = {17}, Year = {2008}, Bdsk-Url-1 = {http://dx.doi.org/10.1007/s00037-008-0250-4}} @article{CHSH69, Author = {John F. Clauser and Michael A. Horne and Abner Shimony and Richard A. Holt}, Date-Modified = {2009-07-28 15:32:43 -0400}, Doi = {10.1103/PhysRevLett.24.549}, Journal = PhysRevLett, Number = 15, Pages = {880--884}, Title = {Proposed Experiment to Test Local Hidden-Variable Theories}, Volume = 23, Year = 1969, Bdsk-Url-1 = {http://dx.doi.org/10.1103/PhysRevLett.24.549}} @book{CovTho91, Author = {Thomas M.~Cover and Joy A.~Thomas}, Edition = {Second}, Note = {ISBN 0-471-24195-4}, Publisher = {John Wiley~\& Sons,~Inc.}, Title = {Elements of Information Theory}, Year = 1991} @article{FoRoSi94, Author = {Lance Fortnow and John Rompel and Michael Sipser}, Doi = {10.1016/0304-3975(94)90251-8}, Journal = {Theoretical Computer Science}, Number = 2, Pages = {545--557}, Title = {On the Power of Multi-Prover Interactive Proof Systems}, Volume = 134, Year = 1994, Bdsk-Url-1 = {http://dx.doi.org/10.1016/0304-3975(94)90251-8}} @inproceedings{Feige91, Author = {Uriel Feige}, Booktitle = {Proc. 6th Ann. Structure in Complexity Theory Conf.}, Date-Modified = {2009-07-01 16:08:31 -0400}, Doi = {10.1109/SCT.1991.160251}, Editorcommented = {Unable to find editor}, Pages = {116--123}, Publisher = {IEEE Comp. Soc. Press}, Title = {On the Success Probability of the Two Provers in One-Round Proof Systems}, Year = 1991, Bdsk-Url-1 = {http://dx.doi.org/10.1109/SCT.1991.160251}} @inproceedings{FGLSS91, Author = {Uriel Feige and Shafi Goldwasser and L{\'a}szl{\'o} Lov{\'a}sz and Shmuel Safra and Mario Szegedy}, Booktitle = FOCS91, Date-Modified = {2009-07-28 14:36:15 -0400}, Doi = {10.1109/SFCS.1991.185341}, Pages = {2--12}, Publisher = {IEEE Comp. Soc. Press}, Title = {Approximating Clique is Almost {NP}-Complete (Preliminary Version)}, Year = {1991}, Bdsk-Url-1 = {http://dx.doi.org/10.1109/SFCS.1991.185341}} @inproceedings{FeKiOD07, Author = {Uriel Feige and Guy Kindler and Ryan O'Donnell}, Booktitle = {Proc. IEEE Conf. Comput. Complexity}, Date-Modified = {2009-07-01 16:01:10 -0400}, Doi = {10.1109/CCC.2007.39}, Pages = {179--192}, Publisher = {IEEE Comp. Soc. Press}, Title = {Understanding Parallel Repetition Requires Understanding Foams}, Year = {2007}, Bdsk-Url-1 = {http://dx.doi.org/10.1109/CCC.2007.39}} @inproceedings{FeiLov92, Author = {Uriel Feige and L{\'a}szl{\'o} Lov{\'a}sz}, Booktitle = STOC92, Date-Modified = {2009-07-01 16:04:08 -0400}, Doi = {10.1145/129712.129783}, Pages = {733--744}, Publisher = {ACM Press}, Title = {Two-Prover One-Round Proof Systems: Their Power and Their Problems}, Year = 1992, Bdsk-Url-1 = {http://dx.doi.org/10.1145/129712.129783}} @article{FeiVer02, Author = {Uriel Feige and Oleg Verbitsky}, Doi = {10.1007/s00493-002-0001-0}, Journal = {Combinatorica}, Number = 4, Pages = {461--478}, Title = {Error Reduction by Parallel Repetition -- a Negative Result}, Volume = 22, Year = 2002, Bdsk-Url-1 = {http://dx.doi.org/10.1007/s00493-002-0001-0}} @phdthesis{Fortno89, Author = {Lance Fortnow}, School = {Massachusetts Institute of Technology}, Title = {Complexity-Theoretic Aspects of Interactive Proof Systems}, Year = 1989} @inproceedings{GolPan06, Author = {Sreenivas Gollapudi and Rina Panigrahy}, Booktitle = {Proc. of 15th ACM Intern. Conf. on Inf. and Knowl. Manag. (CIKM)}, Date-Modified = {2009-07-01 16:04:01 -0400}, Doi = {10.1145/1183614.1183723}, Pages = {768--775}, Publisher = {ACM Press}, Title = {A dictionary for approximate string search and longest prefix search}, Year = {2006}, Bdsk-Url-1 = {http://dx.doi.org/10.1145/1183614.1183723}} @misc{HolRen06, Author = {Thomas Holenstein and Renato Renner}, Date-Modified = {2009-07-28 14:42:25 -0400}, Eprint = {arxiv:cs.IT/0608007}, Title = {On the randomness of independent experiments}, Year = 2006} @inproceedings{Holens07, Author = {Thomas Holenstein}, Booktitle = STOC07, Date-Modified = {2009-07-01 16:03:46 -0400}, Doi = {10.1145/1250790.1250852}, Pages = {411--419}, Publisher = {ACM Press}, Title = {Parallel repetition: {Simplifications} and the no-signaling case}, Year = 2007, Bdsk-Url-1 = {http://dx.doi.org/10.1145/1250790.1250852}} @inproceedings{Khot02, Author = {Subhash Khot}, Booktitle = STOC02, Date-Modified = {2009-07-01 16:03:22 -0400}, Doi = {10.1145/509907.510017}, Pages = {767--775}, Publisher = {ACM Press}, Title = {On the power of unique 2-prover 1-round games}, Year = {2002}, Bdsk-Url-1 = {http://dx.doi.org/10.1145/509907.510017}} @article{KleTar02, Author = {Jon M. Kleinberg and {\'E}va Tardos}, Bibsource = {DBLP, http://dblp.uni-trier.de}, Doi = {10.1145/585265.585268}, Journal = JACM, Number = {5}, Pages = {616--639}, Title = {Approximation algorithms for classification problems with pairwise relationships: {Metric} labeling and {Markov} random fields}, Volume = {49}, Year = {2002}, Bdsk-Url-1 = {http://dx.doi.org/10.1145/585265.585268}} @article{LapSha95, Author = {Dror Lapidot and Adi Shamir}, Doi = {10.1007/BF01200756}, Journal = {Combinatorica}, Number = {2}, Pages = {203--214}, Title = {A One-Round, Two-Prover, Zero-Knowledge Protocol for {NP}}, Volume = {15}, Year = 1995, Bdsk-Url-1 = {http://dx.doi.org/10.1007/BF01200756}} @unpublished{MaMcTa07, Author = {Mark Manasse and Frank McSherry and Kunal Talwar}, Note = {Manuscript}, Title = {Consistent Weighted Sampling}, Year = 2007} @inproceedings{Manber94, Author = {Udi Manber}, Bibsource = {DBLP, http://dblp.uni-trier.de}, Booktitle = {USENIX Winter}, Pages = {1--10}, Title = {Finding Similar Files in a Large File System}, Year = {1994}} @book{NieChu00, Author = {Michael A. Nielsen and Isaac L. Chuang}, Note = {ISBN 0-521-63503-9}, Publisher = {Cambridge University Press}, Title = {Quantum Computation and Quantum Information}, Year = 2000} @inproceedings{PaRaWi97, Author = {Itzhak Parnafes and Ran Raz and Avi Wigderson}, Booktitle = STOC97, Date-Modified = {2009-07-01 16:03:07 -0400}, Doi = {10.1145/258533.258620}, Pages = {363--372}, Publisher = {ACM Press}, Title = {Direct product results and the {GCD} problem, in old and new communication models}, Year = 1997, Bdsk-Url-1 = {http://dx.doi.org/10.1145/258533.258620}} @article{PopRoh94, Author = {Sandu Popescu and Daniel Rohrlich}, Date-Modified = {2009-07-29 09:52:01 -0400}, Doi = {10.1007/BF02058098}, Eprint = {arxiv:quant-ph/9508009}, Journal = {Foundations of Physics}, Month = {March}, Number = {3}, Pages = {379--385}, Title = {Nonlocality as an Axiom for Quantum Theory}, Volume = {24}, Year = 1994, Bdsk-Url-1 = {http://dx.doi.org/10.1007/BF02058098}} @inproceedings{Rao08, Author = {Anup Rao}, Booktitle = STOC08, Date-Modified = {2009-07-01 16:03:05 -0400}, Doi = {10.1145/1374376.1374378}, Pages = {1--10}, Publisher = {ACM Press}, Title = {Parallel repetition in projection games and a concentration bound}, Year = {2008}, Bdsk-Url-1 = {http://dx.doi.org/10.1145/1374376.1374378}} @article{Raz98, Author = {Ran Raz}, Doi = {10.1137/S0097539795280895}, Journal = SIAMComp, Number = 3, Pages = {763--803}, Title = {A Parallel Repetition Theorem}, Volume = 27, Year = 1998, Bdsk-Url-1 = {http://dx.doi.org/10.1137/S0097539795280895}} @inproceedings{Raz08, Author = {Ran Raz}, Booktitle = FOCS08, Date-Modified = {2009-07-01 16:00:28 -0400}, Doi = {10.1109/FOCS.2008.49}, Pages = {369--373}, Publisher = {IEEE Comp. Soc. Press}, Title = {A Counterexample to Strong Parallel Repetition}, Year = {2008}, Bdsk-Url-1 = {http://dx.doi.org/10.1109/FOCS.2008.49}} @inproceedings{Verbit94, Author = {Oleg Verbitsky}, Booktitle = {Proc. 9th Ann. Structure in Complexity Theory Conf.}, Date-Modified = {2009-07-28 14:39:07 -0400}, Doi = {10.1109/SCT.1994.315794}, Pages = {304--307}, Publisher = {IEEE Comp. Soc. Press}, Title = {Towards the Parallel Repetition Conjecture}, Year = 1994, Bdsk-Url-1 = {http://dx.doi.org/10.1109/SCT.1994.315794}} @misc{Beame06, Author = {Paul Beame}, Title = {Personal Communication}, Year = 2006} @misc{Watrou02, Author = {John Watrous}, Note = {Manuscript}, Title = {A note on parallel repetition of two-prover quantum-interactive proofs}, Year = 2002} %%%%%%%%%%%%%%%%%%%%%%%%%% %%%%% bib of v005a009 %%%%%%%%%%%%%%%%%%%%%%%%%% %% ToC#410.bib v005a009 2009-09-13 %% This BibTeX bibliography file was created using BibDesk. %% http://bibdesk.sourceforge.net/ %% Created for Alexander Russell at 2009-08-19 17:22:23 -0400 %% Saved with string encoding Unicode (UTF-8) @comment{Journal of Computer and System Sciences} @comment{Discrete Mathematics} @comment{Algorithmica. An International Journal in Computer Science} @comment{Journal of Symbolic Computation} @comment{Journal of the ACM} @comment{Operations Research} @comment{Journal of Complexity} @comment{SIAM Journal on Computing} @comment{Information Processing Letters} @comment{Journal of Combinatorial Theory. Series A} @string{algorithmica = {Algorithmica}} @string{discretemath = {Discrete Math.}} @string{informprocesslett = {Inform. Process. Lett.}} @string{jacm = {J. ACM}} @string{jcombintheorysera = {J. Combin. Theory Ser. A}} @string{jcomplexity = {J. Complexity}} @string{jcomputsystemsci = {J. Comput. System Sci.}} @string{jsymboliccomput = {J. Symbolic Comput.}} @string{operres = {Oper. Res.}} @string{siamjcomput = {SIAM J. Comput.}} @book{aho, Address = {Boston, MA}, Author = {A. V. Aho and J. E. Hopcroft and J. Ullman}, Publisher = {Addison-Wesley Longman Publishing Co.}, Title = {The Design and Analysis of Computer Algorithms}, Year = 1974} @article{lovasz, Author = {L. Lov\'asz}, Doi = {10.1016/0012-365X(75)90058-8}, Journal = DiscreteMath, Pages = {383--390}, Title = {On the ratio of optimal integral and fractional covers}, Volume = {13}, Year = 1975, Bdsk-Url-1 = {http://dx.doi.org/10.1016/0012-365X(75)90058-8}} @inproceedings{chan07, Author = {T. M. Chan}, Booktitle = {Proc. 39th STOC}, Date-Modified = {2009-08-19 17:20:32 -0400}, Eprint = {stoc:1250790.1250877}, Pages = {590--598}, Publisher = {ACM Press}, Title = {More Algorithms for All-Pairs Shortest Paths in Weighted Graphs}, Year = 2007} @article{chan08, Author = {T. M. Chan}, Eprint = {algorithmica:px2741688g4p4l18}, Journal = Algorithmica, Number = 2, Pages = {236--243}, Title = {All-Pairs Shortest Paths with Real Weights in ${O}(n^3/\log n)$ Time}, Volume = 50, Year = 2008} @article{cw90, Author = {D. Coppersmith and S. Winograd}, Doi = {10.1016/S0747-7171(08)80013-2}, Journal = JSymbolicComput, Number = 3, Pages = {251--280}, Title = {Matrix multiplication via arithmetic progressions}, Volume = 9, Year = 1990, Bdsk-Url-1 = {http://dx.doi.org/10.1016/S0747-7171(08)80013-2}} @article{coppersmith97, Author = {D. Coppersmith}, Doi = {10.1006/jcom.1997.0438}, Journal = JComplexity, Number = 1, Pages = {42--49}, Title = {Rectangular matrix multiplication revisited}, Volume = 13, Year = 1997, Bdsk-Url-1 = {http://dx.doi.org/10.1006/jcom.1997.0438}} @book{DuboisPrade, Author = {D. Dubois and H. Prade}, Publisher = {Academic Press}, Title = {Fuzzy Sets and Systems: Theory and Applications}, Year = 1980} @inproceedings{duanpettie, Author = {R. Duan and S. Pettie}, Booktitle = {Proc. 19th SODA}, Date-Modified = {2009-08-19 17:20:43 -0400}, Eprint = {soda:1496770.1496813}, Pages = {384--391}, Publisher = {ACM Press}, Title = {Fast algorithms for $(\max, \min)$-matrix multiplication and bottleneck shortest paths}, Year = {2009}} @inproceedings{fischer71, Author = {M. J. Fischer and A. R. Meyer}, Booktitle = {Proc. 12th FOCS}, Date-Modified = {2009-08-19 17:20:57 -0400}, Pages = {129--131}, Publisher = {IEEE Comp. Soc. Press}, Title = {{Boolean} Matrix Multiplication and Transitive Closure}, Year = 1971} @article{FT, Author = {M. L. Fredman and R. E. Tarjan}, Eprint = {jacm:28869.28874}, Journal = JACM, Number = 3, Pages = {596--615}, Title = {Fibonacci heaps and their uses in improved network optimization algorithms}, Volume = 34, Year = 1987} @article{furman70, Author = {M. E. Furman}, Journal = {Dokl. Akad. Nauk SSSR (in Russian)}, Pages = {524}, Title = {Applications of a method of fast multiplication of matrices in the problem of finding the transitive closure of a graph}, Volume = 194, Year = 1970} @article{furman70e, Author = {M. E. Furman}, Journal = {Soviet Math. Dokl. (in English)}, Number = 5, Pages = {1252}, Title = {Applications of a method of fast multiplication of matrices in the problem of finding the transitive closure of a graph}, Volume = 11, Year = 1970} @article{GM97, Author = {Z. Galil and O. Margalit}, Eprint = {jcss:10.1006/jcss.1997.1385}, Journal = JComputSystemSci, Pages = {243--254}, Title = {All pairs shortest paths for graphs with small integer length edges}, Volume = 54, Year = 1997} @article{Hu, Author = {T. C. Hu}, Journal = OperRes, Number = 6, Pages = {898--900}, Title = {The Maximum Capacity Route Problem}, Volume = 9, Year = 1961} @article{HP98, Author = {X. Huang and V.~Y. Pan}, Doi = {10.1006/jcom.1998.0476}, Journal = JComplexity, Number = 2, Pages = {257--299}, Title = {Fast rectangular matrix multiplication and applications}, Volume = 14, Year = 1998, Bdsk-Url-1 = {http://dx.doi.org/10.1006/jcom.1998.0476}} @article{KKP, Author = {D. Karger and D. Koller and S. Phillips}, Eprint = {sicomp:10.1137/0222071}, Journal = SIAMJComput, Number = 6, Pages = {1199--1217}, Title = {Finding the Hidden Path: Time Bounds for All-Pairs Shortest Paths}, Volume = 22, Year = 1993} @inproceedings{kl05, Author = {M. Kowaluk and A. Lingas}, Booktitle = {Proc. 32nd Int. Colloq. Autom Lang. Program. (ICALP)}, Date-Modified = {2009-08-19 17:21:18 -0400}, Eprint = {icalp:252dpgap58fdhchf}, Pages = {241--248}, Publisher = {Springer-Verlag}, Rest = {Springer-Verlag LNCS}, Title = {{LCA} queries in directed acyclic graphs}, Volume = 3580, Year = 2005} @article{matousek91, Author = {J. Matou\v{s}ek}, Eprint = {ipl:10.1016/0020-0190(91)90071-O}, Journal = InformProcessLett, Number = 5, Pages = {277--278}, Title = {Computing dominances in ${E}^n$}, Volume = 38, Year = 1991} @article{munro71, Author = {J. I. Munro}, Eprint = {ipl:10.1016/0020-0190(71)90006-8}, Journal = InformProcessLett, Number = 2, Pages = {56--58}, Title = {Efficient Determination of the Transitive Closure of a Directed Graph}, Volume = 1, Year = 1971} @article{Pollack, Author = {M. Pollack}, Journal = OperRes, Number = 5, Pages = {733--736}, Title = {The Maximum Capacity Through a Network}, Volume = 8, Year = 1960} @article{Seidel, Author = {R. Seidel}, Eprint = {jcss:10.1006/jcss.1995.1078}, Journal = JComputSystemSci, Pages = {400--403}, Title = {On the all-pairs-shortest-path problem in unweighted undirected graphs}, Volume = 51, Year = 1995} @inproceedings{syz07, Author = {A. Shapira and R. Yuster and U. Zwick}, Booktitle = {Proc. 17th SODA}, Date-Modified = {2009-08-19 17:21:30 -0400}, Eprint = {soda:1283383.1283488}, Pages = {978--985}, Publisher = {ACM Press}, Title = {All-Pairs Bottleneck Paths in Vertex Weighted Graphs}, Year = 2007, Bdsk-File-1 = {YnBsaXN0MDDUAQIDBAUGCQpYJHZlcnNpb25UJHRvcFkkYXJjaGl2ZXJYJG9iamVjdHMSAAGGoNEHCFRyb290gAFfEA9OU0tleWVkQXJjaGl2ZXKoCwwXGBkdJCVVJG51bGzTDQ4PEBEUViRjbGFzc1dOUy5rZXlzWk5TLm9iamVjdHOAB6ISE4ACgAOiFRaABIAGWWFsaWFzRGF0YVxyZWxhdGl2ZVBhdGjSDRobHFdOUy5kYXRhgAVPEQF0AAAAAAF0AAIAAAxPYWsgUkFJRCBTZXQAAAAAAAAAAAAAAAAAAADDcf5nSCsAAAC41NIJbGItdjQuYXV4AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAMjC+sam86QAAAAAAAAAAAABAAIAAAkgAAAAAAAAAAAAAAAAAAAABFA0MTAAEAAIAADDckS3AAAAEQAIAADGpyvkAAAAAQAUALjU0gB3F8wAdxeIAAi7RAAAedQAAgAyT2FrIFJBSUQgU2V0OlVzZXJzOmFjcjp0b2M6QXJ0aWNsZXM6UDQxMDpsYi12NC5hdXgADgAUAAkAbABiAC0AdgA0AC4AYQB1AHgADwAaAAwATwBhAGsAIABSAEEASQBEACAAUwBlAHQAEgAlVXNlcnMvYWNyL3RvYy9BcnRpY2xlcy9QNDEwL2xiLXY0LmF1eAAAEwABLwAAFQACAAr//wAA0h4fICFYJGNsYXNzZXNaJGNsYXNzbmFtZaMhIiNdTlNNdXRhYmxlRGF0YVZOU0RhdGFYTlNPYmplY3RZbGItdjQuYXV40h4fJieiJyNcTlNEaWN0aW9uYXJ5AAgAEQAaAB8AKQAyADcAOgA/AEEAUwBcAGIAaQBwAHgAgwCFAIgAigCMAI8AkQCTAJ0AqgCvALcAuQIxAjYCPwJKAk4CXAJjAmwCdgJ7An4AAAAAAAACAQAAAAAAAAAoAAAAAAAAAAAAAAAAAAACiw==}} @inproceedings{sz99, Author = {A. Shoshan and U. Zwick}, Booktitle = {Proc. 40th FOCS}, Date-Modified = {2009-08-19 17:21:38 -0400}, Eprint = {focs:10.1109/SFFCS.1999.814635}, Pages = {605--614}, Publisher = {IEEE Comp. Soc. Press}, Title = {All Pairs Shortest Paths in Undirected Graphs with Integer Weights}, Year = 1999} @inproceedings{Sub, Author = {C. R. Subramanian}, Booktitle = {Proc. 10th SODA}, Date-Modified = {2009-08-19 17:21:47 -0400}, Eprint = {soda:314500.314917}, Pages = {795--804}, Publisher = {ACM Press}, Title = {A generalization of {Janson} inequalities and its application to finding shortest paths}, Year = 1999} @inproceedings{vw06, Author = {V. Vassilevska and R. Williams}, Booktitle = {Proc. 38th STOC}, Date-Modified = {2009-08-19 17:21:56 -0400}, Eprint = {stoc:1132516.1132550}, Pages = {225--231}, Publisher = {ACM Press}, Title = {Finding a maximum weight triangle in $n^{3-\delta}$ time, with applications}, Year = 2006} @inproceedings{v08, Author = {V. Vassilevska}, Booktitle = {Proc. 18th SODA}, Date-Modified = {2009-08-19 17:22:13 -0400}, Eprint = {soda:1347082.1347133}, Pages = {465--472}, Publisher = {ACM Press}, Title = {Nondecreasing Paths in Weighted Graphs, or: {How} to optimally read a train schedule}, Year = {2008}} @inproceedings{vwy07, Author = {V. Vassilevska and R. Williams and R. Yuster}, Booktitle = {Proc. 39th STOC}, Date-Modified = {2009-08-19 17:22:22 -0400}, Eprint = {stoc:1250790.1250876}, Pages = {585--589}, Publisher = {ACM Press}, Title = {All-Pairs Bottleneck Paths For General Graphs in Truly Sub-Cubic Time}, Year = 2007} @article{zwickbridge, Author = {U. Zwick}, Eprint = {jacm:567112.567114}, Journal = JACM, Number = 3, Pages = {289--317}, Title = {All pairs shortest paths using bridging sets and rectangular matrix multiplication}, Volume = 49, Year = 2002, Bdsk-File-1 = {YnBsaXN0MDDUAQIDBAUGCQpYJHZlcnNpb25UJHRvcFkkYXJjaGl2ZXJYJG9iamVjdHMSAAGGoNEHCFRyb290gAFfEA9OU0tleWVkQXJjaGl2ZXKoCwwXGBkdJCVVJG51bGzTDQ4PEBEUViRjbGFzc1dOUy5rZXlzWk5TLm9iamVjdHOAB6ISE4ACgAOiFRaABIAGWWFsaWFzRGF0YVxyZWxhdGl2ZVBhdGjSDRobHFdOUy5kYXRhgAVPEQF0AAAAAAF0AAIAAAxPYWsgUkFJRCBTZXQAAAAAAAAAAAAAAAAAAADDcf5nSCsAAAC41NIJbGItdjQuYXV4AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAMjC+sam86QAAAAAAAAAAAABAAIAAAkgAAAAAAAAAAAAAAAAAAAABFA0MTAAEAAIAADDckS3AAAAEQAIAADGpyvkAAAAAQAUALjU0gB3F8wAdxeIAAi7RAAAedQAAgAyT2FrIFJBSUQgU2V0OlVzZXJzOmFjcjp0b2M6QXJ0aWNsZXM6UDQxMDpsYi12NC5hdXgADgAUAAkAbABiAC0AdgA0AC4AYQB1AHgADwAaAAwATwBhAGsAIABSAEEASQBEACAAUwBlAHQAEgAlVXNlcnMvYWNyL3RvYy9BcnRpY2xlcy9QNDEwL2xiLXY0LmF1eAAAEwABLwAAFQACAAr//wAA0h4fICFYJGNsYXNzZXNaJGNsYXNzbmFtZaMhIiNdTlNNdXRhYmxlRGF0YVZOU0RhdGFYTlNPYmplY3RZbGItdjQuYXV40h4fJieiJyNcTlNEaWN0aW9uYXJ5AAgAEQAaAB8AKQAyADcAOgA/AEEAUwBcAGIAaQBwAHgAgwCFAIgAigCMAI8AkQCTAJ0AqgCvALcAuQIxAjYCPwJKAk4CXAJjAmwCdgJ7An4AAAAAAAACAQAAAAAAAAAoAAAAAAAAAAAAAAAAAAACiw==}} @article{stein-hitting, Author = {S. K. Stein}, Eprint = {jcombtha:10.1016/0097-3165(74)90062-4}, Journal = JCombinTheorySerA, Pages = {391--397}, Title = {Two combinatorial covering theorems}, Volume = 16, Year = 1974} @article{johnson-hitting, Author = {D. S. Johnson}, Eprint = {jcss:10.1016/S0022-0000(74)80044-9}, Journal = JComputSystemSci, Pages = {256--278}, Title = {Approximation algorithms for combinatorial problems}, Volume = 9, Year = 1974} @comment{BibDesk Static Groups{ group name Cited keys stein-hitting,Pollack,Seidel,KKP,munro71,kl05,fischer71,Hu,DuboisPrade,HP98,GM97,furman70e,cw90,lovasz,chan07,FT,zwickbridge,Sub,matousek91,sz99,syz07,coppersmith97,chan08,v08,furman70,aho,duanpettie,johnson-hitting,vw06,vwy07 }} %%%%%%%%%%%%%%%%%%%%%%%%%% %%%%% bib of v005a010 %%%%%%%%%%%%%%%%%%%%%%%%%% %% ToC#431.bib v005a010.bib Glasner-Servedio %% This BibTeX bibliography file was created using BibDesk. %% http://bibdesk.sourceforge.net/ %% Created for Alexander Russell at 2009-10-17 17:31:26 -0400 %% Saved with string encoding Unicode (UTF-8) @string{algorithmica = {Algorithmica}} @string{bulleurassoctheorcomputscieatcs = {Bull. Eur. Assoc. Theor. Comput. Sci.}} @string{combinatorica = {Combinatorica}} @string{computcomplexity = {Comput. Complexity}} @string{ieeetransinformtheory = {IEEE Trans. Inform. Theory}} @string{informandcomput = {Inform. and Comput.}} @string{jacm = {J. ACM}} @string{jcomputsystemsci = {J. Comput. System Sci.}} @string{siamjcomput = {SIAM J. Comput.}} @string{siamjdiscretemath = {SIAM J. Discrete Math.}} @article{arosaf98, Author = {Sanjeev Arora and Shmuel Safra}, Eprint = {jacm:273865.273901}, Journal = JACM, Month = jan, Number = {1}, Pages = {70--122}, Title = {Probabilistic checking of proofs: a new characterization of {NP}}, Volume = {45}, Year = {1998}} @article{babforlun, Author = {L. Babai and L. Fortnow and C. Lund}, Date-Modified = {2009-10-17 17:24:48 -0400}, doi = {10.1007/BF01200056}, Journal = ComputComplexity, Number = 1, Pages = {3--40}, Printoutnum = {294}, Title = {{Non-Deterministic Exponential Time has Two-Prover Interactive Protocols}}, Volume = {1}, Year = {1991}} @article{FKRSS03, Author = {E. Fischer and G. Kindler and D. Ron and S. Safra and A. Samorodnitsky}, doi = {10.1016/j.jcss.2003.11.004}, Journal = JComputSystemSci, Number = {4}, Pages = {753--787}, Title = {Testing juntas}, Volume = {68}, Year = {2004}} @book{KearnsVazirani:94, Address = {Cambridge, MA}, Author = {M. Kearns and U. Vazirani}, Date-Modified = {2009-10-17 17:26:46 -0400}, Publisher = {MIT Press}, Title = {An Introduction to Computational Learning Theory}, Year = {1994}} @article{BLR93, Author = {M. Blum and M. Luby and R. Rubinfeld}, doi = {10.1016/0022-0000(93)90044-W}, Journal = JComputSystemSci, Number = 3, Pages = {549--595}, Title = {Self-testing/correcting with applications to numerical problems}, Volume = {47}, Year = {1993}} @inproceedings{DGLRRS, Author = {Y. Dodis and O. Goldreich and E. Lehman and S. Raskhodnikova and D. Ron and A. Samorodnitsky}, Booktitle = {Proc. 3rd Intern. Workshop on Randomization and Approximation Techniques in Comp. Sci. (RANDOM'99)}, Series = {Lecture Notes in Computer Science}, Volume = {1671}, Date-Modified = {2009-10-17 17:31:08 -0400}, Pages = {97--108}, Publisher= {Springer}, Title = {{Improved Testing Algorithms for Monotonocity}}, Doi = {10.1007/b72324}, Year = 1999} @inproceedings{FLNRRS, Author = {E. Fischer and E. Lehman and I. Newman and S. Raskhodnikova and R. Rubinfeld and A. Samorodnitsky}, Booktitle = {Proc. 34th STOC}, Date-Modified = {2009-10-17 17:27:37 -0400}, Eprint = {stoc:10.1145/509907.509977}, Pages = {474--483}, Title = {{Monotonicity Testing Over General Poset Domains}}, Year = 2002} @article{GGLRS, Author = {O. Goldreich and S. Goldwasser and E. Lehman and D. Ron and A. Samordinsky}, Date-Modified = {2009-10-17 17:25:03 -0400}, doi = {10.1007/s004930070011}, Journal = Combinatorica, Number = 3, Pages = {301--337}, Title = {{Testing Monotonicity}}, Volume = 20, Year = 2000} @article{GGR98, Author = {O. Goldreich and S. Goldwasser and D. Ron}, Eprint = {jacm:285055.285060}, Journal = JACM, Pages = {653--750}, Title = {Property testing and its connection to learning and approximation}, Volume = {45}, Year = {1998}} @article{PRS02, Author = {M. Parnas and D. Ron and A. Samorodnitsky}, Date-Modified = {2009-10-17 17:25:19 -0400}, doi = {10.1137/S0895480101407444}, Journal = SIAMJDiscreteMath, Number = 1, Pages = {20--46}, Title = {{Testing Basic {Boolean} Formulae}}, Url = {citeseer.ifi.unizh.ch/parnas02testing.html}, Volume = 16, Year = 2002, Bdsk-Url-1 = {citeseer.ifi.unizh.ch/parnas02testing.html}} @article{RS96, Author = {R. Rubinfeld and M. Sudan}, doi = {10.1137/S0097539793255151}, Journal = SIAMJComput, Number = 2, Pages = {252--271}, Title = {Robust characterizations of polynomials with applications to program testing}, Volume = {25}, Year = {1996}} @article{AKKLRtit, Author = {N. Alon and T. Kaufman and M. Krivelevich and S. Litsyn and D. Ron}, Date-Modified = {2009-10-17 17:25:49 -0400}, doi = {10.1109/TIT.2005.856958}, Journal = IEEETransInformTheory, Number = {11}, Pages = {4032--4039}, Title = {{Testing {Reed}-{Muller} Codes}}, Volume = {51}, Year = 2005} @article{Fischer:01, Author = {E. Fischer}, Date-Modified = {2009-10-17 17:25:59 -0400}, Journal = BullEurAssocTheorComputSciEATCS, Pages = {97--126}, Title = {{The Art of Uninformed Decisions: {A} Primer to Property Testing}}, Volume = {75}, Year = {2001}} @inproceedings{DLM+:07, Author = {I. Diakonikolas and H. Lee and K. Matulef and K. Onak and R. Rubinfeld and R. Servedio and A. Wan}, Booktitle = {Proc. 48th FOCS}, Date-Modified = {2009-10-17 17:27:47 -0400}, Eprint = {focs:10.1109/FOCS.2007.32}, Pages = {549--558}, Title = {{Testing for Concise Representations}}, Publisher = {IEEE Comp. Soc. Press}, Year = {2007}} @inproceedings{HalevyKushilevitz:05, Author = {S. Halevy and E. Kushilevitz}, Booktitle = {Proc. 9th Intern. Workshop on Randomization and Approximation Techniques in Comp. Sci. (RANDOM'05)}, Date-Modified = {2009-10-17 17:27:56 -0400}, DOI = {10.1007/11538462\_28}, Series = {Lecture Notes in Computer Science}, Pages = {330--341}, Volume = 3624, Publisher= {Springer}, Title = {{A Lower Bound for Distribution-Free Monotonicity Testing}}, Year = {2005}} @incollection{R01, Author = {D. Ron}, Booktitle = {Handbook of Randomized Computing}, Date-Modified = {2009-10-17 17:26:59 -0400}, Editors = {S. Rajasekaran, P. M. Pardalos, J. H. Reif, J. D. P. Rolim}, Pages = {597--649}, Publisher = {Kluwer}, Title = {{Property Testing (A Tutorial)}}, Volume = 2, Year = {2000}} @incollection{Goldreich:98proptest, Author = {O. Goldreich}, Booktitle = {Randomization Methods in Algorithm Design}, Date-Modified = {2009-10-17 17:27:09 -0400}, Pages = {45--60}, Publisher = {AMS-DIMACS}, Title = {{Combinatorial Property Testing -- a survey}}, Year = 1998} @inproceedings{Rubinfeld:06survey, Author = {R. Rubinfeld}, Booktitle = {Proc. Intern. Congress of Mathematicians}, Date-Modified = {2009-10-17 17:28:41 -0400}, Pages = {1095--1110}, Publisher = {European Math. Soc.}, Title = {Sublinear time algorithms}, Volume = {3}, Year = {2006}} @incollection{AlonShapira:07, Author = {N. Alon and A. Shapira}, Booktitle = {Topics in Discrete Mathematics}, Date-Modified = {2009-10-17 17:27:18 -0400}, Pages = {281--313}, Publisher = {Springer}, Series = {Algorithms and Combinatorics}, Title = {{Homomorphisms in Graph Property Testing - A Survey}}, Volume = 26, Year = {2006}} @article{HalevyKushilevitz:07, Author = {S. Halevy and E. Kushilevitz}, Date-Modified = {2009-10-17 17:26:10 -0400}, Eprint = {sicomp:10.1137/050645804}, Journal = SIAMJComput, Number = {4}, Pages = {1107--1138}, Title = {{Distribution-Free Property Testing}}, Volume = {37}, Year = {2007}} @article{HalevyKushilevitz:08, Author = {S. Halevy and E. Kushilevitz}, Date-Modified = {2009-10-17 17:26:25 -0400}, doi = {10.1007/s00453-007-9054-1}, Journal = Algorithmica, Number = {1}, Pages = {24--48}, Title = {{Distribution-Free Connectivity Testing for Sparse Graphs}}, Volume = {51}, Year = {2004}} @article{AilonChazelle:06, Author = {N. Ailon and B. Chazelle}, Date-Modified = {2009-10-17 17:26:36 -0400}, doi = {10.1016/j.ic.2006.06.001}, Journal = InformandComput, Number = 11, Pages = {1704--1717}, Title = {Information theory in property testing and monotonicity testing in higher dimension}, Volume = {204}, Year = {2006}} @inproceedings{Turan:93, Author = {G. Tur{\'a}n}, Booktitle = {Proc. 6th Ann. Conf. Comput. Learning Theory}, Eprint = {acm:10.1145/168304.168382}, Pages = {384--391}, Publisher = {ACM Press}, Title = {Lower bounds for {PAC} learning with queries}, Year = {1993}} @inproceedings{MORS:09short, Author = {K. Matulef and R. O'Donnell and R. Rubinfeld and R. Servedio}, Booktitle = {Proc. 19th Annual ACM-SIAM Symp. Dicrete Algorithms (SODA)}, Date-Modified = {2009-10-17 17:28:58 -0400}, Pages = {256--264}, Eprint = {acm:1496770.1496799}, Publisher = {ACM Press}, Title = {{Testing Halfspaces}}, Year = {2009}} %%%%%%%%%%%%%%%%%%%%%%%%%% %%%%% bib of v005a011 %%%%%%%%%%%%%%%%%%%%%%%%%% %% This BibTeX bibliography file was created using BibDesk. %% http://bibdesk.sourceforge.net/ %% Created for Alexander Russell at 2009-11-17 11:26:41 -0500 %% Saved with string encoding Unicode (UTF-8) @comment{Physical Review Letters} @comment{Physical Review. A.} @comment{Pacific Journal of Mathematics} @comment{Linear Algebra and its Applications} @comment{Letters in Mathematical Physics. A Journal for the Rapid Dissemination of Short Contributions in the Field of Mathematical Physics} @comment{SIAM Journal on Optimization} @comment{SIAM Review} @comment{Journal of Modern Optics} @comment{Communications in Mathematical Physics} @comment{Quantum Information & Computation} @comment{Russian Mathematical Surveys} @comment{Journal of Functional Analysis} @comment{Journal of the London Mathematical Society} @comment{Reports on Mathematical Physics} @string{commmathphys = {Comm. Math. Phys.}} @string{jfunctanal = {J. Funct. Anal.}} @string{jlondonmathsoc = {J. London Math. Soc.}} @string{jmodernopt = {J. Modern Opt.}} @string{lettmathphys = {Lett. Math. Phys.}} @string{linearalgebraappl = {Linear Algebra Appl.}} @string{pacificjmath = {Pacific J. Math.}} @string{physreva = {Phys. Rev. A}} @string{physrevlett = {Phys. Rev. Lett.}} @string{quantuminfcomput = {Quantum Inf. Comput.}} @string{repmathphys = {Rep. Math. Phys.}} @string{russianmathsurveys = {Russian Math. Surveys}} @string{siamjoptim = {SIAM J. Optim.}} @string{siamrev = {SIAM Rev.}} @article{Acin01, Annote = {Also available as arXiv.org e-print quant-ph/0102064}, Author = {A. Ac{\'\i}n}, Eprint = {prl:10.1103/PhysRevLett.87.177901}, Journal = PhysRevLett, Key = {Acin01}, Number = 17, Pages = 177901, Title = {Statistical Distinguishability between Unitary Operations}, Volume = 87, Year = 2001} @inproceedings{AharonovKN98, Author = {D. Aharonov and A. Kitaev and N. Nisan}, Booktitle = {Proc. 30th STOC}, Date-Modified = {2009-11-17 11:26:06 -0500}, Eprint = {stoc:10.1145/276698.276708}, Pages = {20--30}, Publisher = {ACM Press}, Title = {Quantum Circuits with Mixed States}, Year = 1998} @article{Alberti83, Author = {P. Alberti}, doi = {10.1007/BF00398708}, Journal = LettMathPhys, Number = 1, Pages = {25--32}, Title = {A note on the transition probability over {$C^{\ast}$}-algebras}, Volume = 7, Year = 1983} @article{Alizadeh95, Author = {F. Alizadeh}, Date-Modified = {2009-11-17 11:12:54 -0500}, Eprint = {siopt:10.1137/0805002}, Journal = SIAMJOptim, Number = 1, Pages = {13--51}, Title = {Interior point methods in semidefinite programming with applications to combinatorial optimization}, Volume = 5, Year = 1995} @misc{Ben-AroyaT09, Author = {A. Ben-Aroya and A. Ta-Shma}, Date-Modified = {2009-11-17 11:26:36 -0500}, Eprint = {arxiv:0902.3397}, Howpublished = {arXiv.org e-Print 0902.3397}, Title = {On the complexity of approximating the diamond norm}, Year = 2009} @book{Bhatia97, Author = {R. Bhatia}, Date-Modified = {2009-11-17 11:20:13 -0500}, Publisher = {Springer}, Title = {Matrix Analysis}, Year = 1997} @book{BoydV04, Author = {S. Boyd and L. Vandenberghe}, Date-Modified = {2009-11-17 11:20:05 -0500}, Publisher = {Cambridge University Press}, Title = {Convex Optimization}, Year = 2004} @book{Bugeaud04, Address = {Cambridge}, Author = {Y. Bugeaud}, Publisher = {Cambridge University Press}, Series = {Cambridge Tracts in Mathematics}, Title = {Approximation by Algebraic Numbers}, Volume = 160, Year = 2004} @article{ChildsPR00, Annote = {Also available as arXiv.org e-print quant-ph/9904021}, Author = {A. Childs and J. Preskill and J. Renes}, Doi = {10.1080/09500340008244034}, Eprint = {arxiv:quant-ph/9904021}, Journal = JModernOpt, Number = {2--3}, Pages = {155--176}, Title = {Quantum information and precision measurement}, Volume = 47, Year = 2000, Bdsk-Url-1 = {http://dx.doi.org/10.1080/09500340008244034}} @article{Choi75, Author = {M.-D. Choi}, Date-Modified = {2009-11-17 11:11:49 -0500}, Eprint = {elsevier:10.1016/0024-3795(75)90075-0}, Journal = LinearAlgebraAppl, Number = 3, Pages = {285--290}, Title = {Completely Positive Linear Maps on Complex Matrices}, Volume = 10, Year = 1975} @article{DArianoPP01, Author = {G. {D'Ariano} and P. Presti and M. Paris}, Date-Modified = {2009-11-17 11:18:57 -0500}, Eprint = {prl:10.1103/PhysRevLett.87.270404}, Journal = PhysRevLett, Number = 27, Pages = 270404, Title = {Using Entanglement Improves the Precision of Quantum Measurements}, Volume = 87, Year = 2001} @article{DevetakJKR06, Author = {I. Devetak and M. Junge and C. King and M. B. Ruskai}, doi = {10.1007/s00220-006-0034-0}, Journal = CommMathPhys, Number = 1, Pages = {37--63}, Title = {Multiplicativity of Completely Bounded $p$-Norms Implies a New Additivity Result}, Volume = 266, Year = 2006} @article{EvenS+84, Author = {S. Even and A. Selman and Y. Yacobi}, Eprint = {elsevier:10.1016/S0019-9958(84)80056-X}, Journal = {Inform. and Control}, Number = 2, Pages = {159--173}, Title = {The complexity of promise problems with applications to public-key cryptography}, Volume = 61, Year = 1984} @article{GilchristLN05, Author = {A. Gilchrist and N. Langford and M. Nielsen}, Eprint = {pra:10.1103/PhysRevA.71.062310}, Journal = PhysRevA, Number = 6, Pages = 062310, Title = {Distance measures to compare real and ideal quantum processes}, Volume = 71, Year = 2005} @book{GrotschelLS93, Author = {M. {Gr\"otschel} and L. {Lov\'asz} and A. Schrijver}, Edition = {Second corrected}, Publisher = {Springer--Verlag}, Title = {Geometric Algorithms and Combinatorial Optimization}, Year = 1993} @inproceedings{GutoskiW07, Author = {G. Gutoski and J. Watrous}, Booktitle = {Proc. 39th STOC}, Date-Modified = {2009-11-17 11:25:59 -0500}, Eprint = {stoc:10.1145/1250790.1250873}, Pages = {565--574}, Publisher = {ACM Press}, Title = {Toward a general theory of quantum games}, Year = 2007} @article{Jenvccova06, Author = {A. {Jen{\v{c}}ov{\'a}}}, Date-Modified = {2009-11-17 11:12:23 -0500}, doi = {10.1007/s00220-006-0035-z}, Journal = CommMathPhys, Number = 1, Pages = {65--70}, Title = {A Relation Between Completely Bounded Norms and Conjugate Channels}, Volume = 266, Year = 2006} @article{JohnstonKP09, Author = {N. Johnston and D. Kribs and V. Paulsen}, Journal = QuantumInfComput, Number = 1, Pages = {16--35}, Title = {Computing stabilized norms for quantum operations}, Volume = 9, Year = 2009} @article{Kitaev97, Author = {A. Kitaev}, Date-Modified = {2009-11-17 11:19:48 -0500}, Doi = {10.1070/RM1997v052n06ABEH002155}, Journal = RussianMathSurveys, Number = 6, Pages = {1191--1249}, Title = {Quantum computations: {Algorithms} and error correction}, Volume = 52, Year = 1997, Bdsk-Url-1 = {http://dx.doi.org/10.1070/RM1997v052n06ABEH002155}} @book{KitaevSV02, Author = {A. Kitaev and A. Shen and M. Vyalyi}, Date-Modified = {2009-11-17 11:21:14 -0500}, Publisher = {American Mathematical Society}, Series = {Graduate Studies in Mathematics}, Title = {Classical and Quantum Computation}, Volume = 47, Year = 2002} @inproceedings{KitaevW00, Author = {A. Kitaev and J. Watrous}, Booktitle = {Proc. 32nd STOC}, Date-Modified = {2009-11-17 11:25:45 -0500}, Eprint = {stoc:10.1145/335305.335387}, Pages = {608--617}, Publisher = {ACM Press}, Title = {Parallelization, amplification, and exponential time simulation of quantum interactive proof system}, Year = 2000} @article{KretschmannSW08, Author = {D. Kretschmann and D. Schlingemann and R. Werner}, Eprint = {elsevier:10.1016/j.jfa.2008.07.023}, Journal = JFunctAnal, Number = 8, Pages = {1889--1904}, Title = {A continuity theorem for {Stinespring's} dilation}, Volume = 255, Year = 2008} @incollection{Lovasz03, Author = {L. {Lov\'asz}}, Booktitle = {Recent Advances in Algorithms and Combinatorics}, Date-Modified = {2009-11-17 11:21:29 -0500}, Pages = {137--194}, Publisher = {Springer}, Title = {Semidefinite programs and combinatorial optimization}, Year = 2003} @book{Paulsen02, Author = {V. Paulsen}, Publisher = {Cambridge University Press}, Series = {Cambridge Studies in Advanced Mathematics}, Title = {Completely Bounded Maps and Operator Algebras}, Year = 2002} @article{Perez-GarciaWPVJ08, Author = {D. {P\'erez-Garc\'ia} and M. Wolf and C. Palazuelos and I. Villanueva and M. Junge}, Date-Modified = {2009-11-17 11:11:38 -0500}, doi = {10.1007/s00220-008-0418-4}, Journal = CommMathPhys, Number = 2, Pages = {455--486}, Title = {Unbounded Violation of Tripartite {Bell} Inequalities}, Volume = 279, Year = 2008} @article{PianiW09, Author = {M. Piani and J. Watrous}, Eprint = {prl:10.1103/PhysRevLett.102.250501}, Journal = PhysRevLett, Number = 25, Pages = 250501, Title = {All entangled states are useful for channel discrimination}, Volume = 102, Year = 2009} @inproceedings{Rosgen08, Author = {B. Rosgen}, Booktitle = {Proc. 25th Intern. Symp. Theor. Aspects Comput. Sci.}, Date-Modified = {2009-11-17 11:22:32 -0500}, Pages = {597--608}, Publisher = {IBFI Schloss Dagstuhl}, Title = {Distinguishing short quantum computations}, Url = {http://drops.dagstuhl.de/opus/volltexte/2008/1322}, Year = 2008, Bdsk-Url-1 = {http://drops.dagstuhl.de/opus/volltexte/2008/1322}} @inproceedings{RosgenW05, Author = {B. Rosgen and J. Watrous}, Booktitle = {Proc. 20th Ann. Conf. Comput. Complexity}, Date-Modified = {2009-11-17 11:24:58 -0500}, Eprint = {ccc:10.1109/CCC.2005.21}, Pages = {344--354}, Publisher = {IEEE Comp. Soc. Press}, Title = {On the hardness of distinguishing mixed-state quantum computations}, Year = 2005} @article{Sacchi05, Author = {M. Sacchi}, Eprint = {pra:10.1103/PhysRevA.71.062340}, Journal = PhysRevA, Number = 6, Pages = 062340, Title = {Optimal discrimination of quantum operations}, Volume = 71, Year = 2005} @article{Sacchi05b, Author = {M. Sacchi}, Eprint = {pra:10.1103/PhysRevA.72.014305}, Journal = PhysRevA, Number = 1, Pages = 014305, Title = {Entanglement can enhance the distinguishability of entanglement-breaking channels}, Volume = 72, Year = 2005} @article{Smith83, Author = {R. Smith}, Doi = {10.1112/jlms/s2-27.1.157}, Journal = JLondonMathSoc, Number = 1, Pages = {157--166}, Title = {Completely bounded maps between {$C^{\ast}$}-algebras}, Volume = 2, Year = 1983, Bdsk-Url-1 = {http://dx.doi.org/10.1112/jlms/s2-27.1.157}} @article{Uhlmann76, Author = {A. Uhlmann}, Journal = RepMathPhys, Number = 2, Pages = {273--279}, Title = {The ``transition probability'' in the state space of a $\ast$-algebra}, Volume = 9, Year = 1976} @article{VandenbergheB96, Author = {L. Vandenberghe and S. Boyd}, Date-Modified = {2009-11-17 11:12:04 -0500}, Eprint = {sirev:10.1137/1038003}, Journal = SIAMRev, Number = 1, Pages = {49--95}, Title = {Semidefinite programming}, Volume = 38, Year = 1996} @article{Watrous05, Author = {J. Watrous}, Date-Modified = {2009-11-17 11:12:33 -0500}, Journal = QuantumInfComput, Number = 1, Pages = {58--68}, Title = {Notes on super-operator norms induced by {Schatten} norms}, Volume = 5, Year = 2005} @article{Watrous08, Author = {J. Watrous}, Journal = QuantumInfComput, Number = 9, Pages = {819--833}, Title = {Distinguishing quantum operations with few {Kraus} operators}, Volume = 8, Year = 2008} @article{Zarikian06, Author = {V. Zarikian}, Eprint = {elsevier:10.1016/j.laa.2006.06.012}, Journal = LinearAlgebraAppl, Number = {2--3}, Pages = {710--734}, Title = {Alternating-projection algorithms for operator-theoretic calculation}, Volume = 419, Year = 2006} @book{deKlerk02, Address = {Dordrecht}, Author = {E. de Klerk}, Publisher = {Kluwer Academic Publishers}, Series = {Applied Optimization}, Title = {Aspects of Semidefinite Programming -- Interior Point Algorithms and Selected Applications}, Volume = 65, Year = 2002} @article{dePillis67, Author = {J. de Pillis}, Date-Modified = {2009-11-17 11:20:49 -0500}, Journal = PacificJMath, Number = 1, Pages = {129--137}, Title = {Linear transformations which preserve {Hermitian} and positive semidefinite operators}, Volume = 23, Year = 1967} %%%%%%%%%%%%%%%%%%%%%%%%%% %%%%% bib of v005a012 %%%%%%%%%%%%%%%%%%%%%%%%%% %% This BibTeX bibliography file was created using BibDesk. %% http://bibdesk.sourceforge.net/ %% Created for Alexander Russell at 2009-12-03 09:16:01 -0500 %% Saved with string encoding Unicode (UTF-8) @comment{Institute of Electrical and Electronics Engineers. Transactions on Information Theory} @comment{Combinatorica. An International Journal on Combinatorics and the Theory of Computing} @comment{Electronic Colloquium on Computational Complexity} @string{combinatorica = {Combinatorica}} @string{eccc = {Electron. Colloq. Comput. Complex. (ECCC)}} @string{ieeetransinformtheory = {IEEE Trans. Inform. Theory}} @inproceedings{bfls, Author = {L{\'a}szl{\'o} Babai and Lance Fortnow and Leonid A. Levin and Mario Szegedy}, Booktitle = {Proc. 23rd STOC}, Date-Modified = {2009-12-03 09:15:58 -0500}, Eprint = {stoc:10.1145/103418.103428}, Pages = {21--31}, Publisher = {ACM Press}, Title = {Checking computations in polylogarithmic time}, Year = {1991}} @article{info, Author = {Amir Bennatan and David Burshtein}, Date-Modified = {2009-12-03 08:59:08 -0500}, Eprint = {ieee:10.1109/TIT.2004.824917}, Journal = IEEETransInformTheory, Number = {3}, Pages = {417--438}, Title = {On the Application of {LDPC} Codes to Arbitrary Discrete-Memoryless Channels}, Volume = {50}, Year = {2004}} @inproceedings{robten, Author = {Eli Ben-Sasson and Madhu Sudan}, Bibdate = {2004-12-13}, Bibsource = {DBLP, http://dblp.uni-trier.de/db/conf/approx/approx2004.html#Ben-SassonS04}, Booktitle = {Proc. 8th Intern. Workshop on Randomization and Comput. (RANDOM'04)}, Date-Modified = {2009-12-03 09:09:12 -0500}, Doi = {10.1007/b99805}, Editor = {Klaus Jansen and Sanjeev Khanna and Jos{\'e} D. P. Rolim and Dana Ron}, Eprint = {eccc:TR04-046}, Isbn = {3-540-22894-2}, Pages = {286--297}, Publisher = {Springer}, Series = {LNCS}, Title = {Robust Locally Testable Codes and Products of Codes}, Url = {http://springerlink.metapress.com/openurl.asp?genre=article&issn=0302-9743&volume=3122&spage=286}, Volume = {3122}, Year = {2004}, Bdsk-Url-1 = {http://springerlink.metapress.com/openurl.asp?genre=article&issn=0302-9743&volume=3122&spage=286}} @inproceedings{BV08, Author = {Eli Ben-Sasson and Michael Viderman}, Bibdate = {2008-09-02}, Bibsource = {DBLP,http://dblp.uni-trier.de/db/conf/approx/approx2008.html#Ben-SassonV08}, Booktitle = {Proc. 12th Intern. Workshop on Randomization and Comput. (RANDOM'08)}, Date-Modified = {2009-12-03 09:09:47 -0500}, Doi = {10.1007/978-3-540-85363-3\_24}, Editor = {Ashish Goel and Klaus Jansen and Jos{\'e} D. P. Rolim and Ronitt Rubinfeld}, Isbn = {978-3-540-85362-6}, Pages = {290--302}, Publisher = {Springer}, Series = {LNCS}, Title = {Tensor Products of Weakly Smooth Codes Are Robust}, Volume = {5171}, Year = {2008}} @techreport{nonrobusttwo, Author = {Don Coppersmith and Atri Rudra}, Bibdate = {2006-06-30}, Bibsource = {DBLP, http://dblp.uni-trier.de/db/journals/eccc/eccc12.html#TR05-104}, Date-Modified = {2009-12-03 09:04:06 -0500}, Eprint = {eccc:TR05-104}, Institution = {Elect. Colloq. Comput. Complex. (ECCC)}, Journal = eccc, Number = {104}, Title = {On the Robust Testability of Product of Codes}, Url = {http://eccc.hpi-web.de/eccc-reports/2005/TR05-104/index.html}, Year = {2005}, Bdsk-Url-1 = {http://eccc.hpi-web.de/eccc-reports/2005/TR05-104/index.html}} @inproceedings{roblocten, Author = {Irit Dinur and Madhu Sudan and Avi Wigderson}, Bibdate = {2006-12-15}, Bibsource = {DBLP, http://dblp.uni-trier.de/db/conf/approx/approx2006.html#DinurSW06}, Booktitle = {Proc. 10th Intern. Workshop on Randomization and Comput. (RANDOM'06)}, Date-Modified = {2009-12-03 09:11:11 -0500}, Doi = {10.1007/11830924\_29}, Editor = {Josep D{\'\i}az and Klaus Jansen and Jos{\'e} D. P. Rolim and Uri Zwick}, Eprint = {eccc:TR06-118}, Isbn = {3-540-38044-2}, Pages = {304--315}, Publisher = {Springer}, Series = {LNCS}, Title = {Robust Local Testability of Tensor Products of {LDPC} Codes}, Url = {http://dx.doi.org/10.1007/11830924_29}, Volume = {4110}, Year = {2006}, Bdsk-Url-1 = {http://dx.doi.org/10.1007/11830924_29}} @book{gallager1, Author = {R. G. Gallager}, Publisher = {MIT Press}, Title = {Low-density Parity Check Codes}, Year = {1963}} @book{gallager2, Author = {R. G. Gallager}, Publisher = {Wiley, New York}, Title = {Information Theory and Reliable Communication}, Year = {1968}} @techreport{shortcodes, Author = {Oded Goldreich}, Bibdate = {2006-06-30}, Bibsource = {DBLP, http://dblp.uni-trier.de/db/journals/eccc/eccc12.html#TR05-014}, Date-Modified = {2009-12-03 09:02:50 -0500}, Eprint = {eccc:TR05-014}, Institution = {Elect. Colloq. Comput. Complex. (ECCC)}, Number = {014}, Title = {Short Locally Testable Codes and Proofs (Survey)}, Url = {http://eccc.hpi-web.de/eccc-reports/2005/TR05-014/index.html}, Year = {2005}, Bdsk-Url-1 = {http://eccc.hpi-web.de/eccc-reports/2005/TR05-014/index.html}} @techreport{nonrobustthree, Author = {Oded Goldreich and Or Meir}, Bibdate = {2009-02-13}, Bibsource = {DBLP, http://dblp.uni-trier.de/db/journals/eccc/eccc14.html#GoldreichM07}, Date-Modified = {2009-12-03 09:05:26 -0500}, Eprint = {eccc:TR07-062}, Institution = {Elect. Colloq. Comput. Complex. (ECCC)}, Journal = eccc, Number = {062}, Title = {The Tensor Product of Two Good Codes Is Not Necessarily Robustly Testable}, Url = {http://eccc.hpi-web.de/eccc-reports/2007/TR07-062/index.html}, Year = {2007}, Bdsk-Url-1 = {http://eccc.hpi-web.de/eccc-reports/2007/TR07-062/index.html}} @inproceedings{codesandpcp, Author = {Oded Goldreich and Madhu Sudan}, Bibdate = {2007-07-26}, Bibsource = {DBLP, http://dblp.uni-trier.de/db/conf/focs/focs2002.html#GoldreichS02}, Booktitle = {Proc. 43rd FOCS}, Date-Modified = {2009-12-03 09:15:41 -0500}, Eprint = {focs:10.1109/SFCS.2002.1181878,eccc:TR02-050}, Isbn = {0-7695-1822-2}, Pages = {13--22}, Publisher = {IEEE Comp. Soc. Press}, Title = {Locally Testable Codes and {PCP}s of Almost-Linear Length}, Url = {http://doi.ieeecomputersociety.org/10.1109/SFCS.2002.1181878}, Year = {2002}, Bdsk-Url-1 = {http://doi.ieeecomputersociety.org/10.1109/SFCS.2002.1181878}} @article{margulis, Author = {Grigori{\u\i} A. Margulis}, Date-Modified = {2009-12-03 09:12:03 -0500}, Doi = {10.1007/BF02579283}, Journal = Combinatorica, Number = {1}, Pages = {71--78}, Title = {Explicit constructions of graphs without short cycles and low density codes}, Volume = {2}, Year = {1982}} @inproceedings{meir, Author = {Or Meir}, Bibdate = {2008-05-23}, Bibsource = {DBLP, http://dblp.uni-trier.de/db/conf/stoc/stoc2008.html#Meir08}, Booktitle = {Proc. 40th STOC}, Date-Modified = {2009-12-03 09:15:30 -0500}, Editor = {Richard E. Ladner and Cynthia Dwork}, Eprint = {stoc:1374376.1374419}, Isbn = {978-1-60558-047-0}, Pages = {285--294}, Publisher = {ACM Press}, Title = {Combinatorial construction of locally testable codes}, Url = {http://doi.acm.org/10.1145/1374376.1374419}, Year = {2008}, Bdsk-Url-1 = {http://doi.acm.org/10.1145/1374376.1374419}} @article{sipser, Author = {Michael Sipser and Daniel A. Spielman}, Eprint = {ieee:10.1109/18.556667}, Journal = IEEETransInformTheory, Note = {Preliminary version appeared in FOCS 1994}, Number = {6}, Pages = {1710--1722}, Title = {Expander Codes}, Volume = {42}, Year = {1996}} @article{effdecod, Author = {Daniel A. Spielman}, Eprint = {ieee:10.1109/18.556668}, Journal = IEEETransInformTheory, Note = {Preliminary version appeared in STOC 1995}, Number = {6}, Pages = {1723--1731}, Title = {Linear-time Encodable and Decodable Error-Correcting Codes}, Volume = {42}, Year = {1996}} @inproceedings{nonrobust, Author = {Paul Valiant}, Bibdate = {2005-10-10}, Bibsource = {DBLP, http://dblp.uni-trier.de/db/conf/approx/approx2005.html#Valiant05}, Booktitle = {Proc. 9th Intern. Workshop on Randomization and Comput. (RANDOM'05)}, Date-Modified = {2009-12-03 09:12:53 -0500}, Doi = {10.1007/11538462\_40}, Editor = {Chandra Chekuri and Klaus Jansen and Jos{\'e} D. P. Rolim and Luca Trevisan}, Isbn = {3-540-28239-4}, Pages = {472--481}, Publisher = {Springer}, Series = {LNCS}, Title = {The Tensor Product of Two Codes Is Not Necessarily Robustly Testable}, Url = {http://dx.doi.org/10.1007/11538462_40}, Volume = {3624}, Year = {2005}, Bdsk-Url-1 = {http://dx.doi.org/10.1007/11538462_40}} %%%%%%%%%%%%%%%%%%%%%%%%%% %%%%% bib of v005a013 %%%%%%%%%%%%%%%%%%%%%%%%%% %% This BibTeX bibliography file was created using BibDesk. %% http://bibdesk.sourceforge.net/ %% Created for Alexander Russell at 2009-12-10 20:58:26 -0500 %% Saved with string encoding Unicode (UTF-8) @comment{Journal of the ACM} @comment{SIAM Journal on Computing} @comment{Combinatorica. An International Journal on Combinatorics and the Theory of Computing} @comment{Journal of Computer and System Sciences} @comment{Rossiiskaya Akademiya Nauk. Matematicheskie Zametki} @comment{Random Structures & Algorithms} @comment{Publications Mathematiques. Institut de Hautes Etudes Scientifiques} @string{combinatorica = {Combinatorica}} @string{jacm = {J. ACM}} @string{jcomputsystemsci = {J. Comput. System Sci.}} @string{matzametki = {Mat. Zametki}} @string{publmathinsthautesetudessci = {Publ. Math. Inst. Hautes Etudes Sci.}} @string{randomstructuresalgorithms = {Random Structures Algorithms}} @string{siamjcomput = {SIAM J. Comput.}} @inproceedings{BFK+:93, Author = {A. Blum and M. Furst and M. Kearns and R. Lipton}, Booktitle = {Proc. Advances in Cryptology -- CRYPTO'93}, Date-Modified = {2009-12-10 13:35:42 -0500}, Doi = {10.1007/3-540-48329-2}, Location = {Santa Barbara, California}, Number = 773, Pages = {278--291}, Publisher = {Springer}, Series = {LNCS}, Title = {Cryptographic Primitives Based on Hard Learning Problems}, Year = {1993}, Bdsk-Url-1 = {http://dx.doi.org/10.1007/3-540-48329-2}} @inproceedings{BluLigRot-2008, Author = {A. Blum and K. Ligett and A. Roth}, Booktitle = {Proc. 40th {STOC}}, Date-Modified = {2009-12-10 13:20:52 -0500}, Eprint = {stoc:10.1145/1374376.1374464}, Pages = {609--618}, Publisher = {ACM Press}, Title = {A Learning Theory Perspective on Data Privacy: {New} Hope for Releasing Useful Databases Privately}, Year = {2008}} @conference{dachman2008optimal, Author = {D. Dachman-Soled and H. K. Lee and T. Malkin and R. A. Servedio and A. Wan and H. Wee}, Booktitle = {Proc. 35th Intern. Colloq. Automata, Languages and Programming, Part I}, Date-Modified = {2009-12-10 13:36:39 -0500}, Doi = {10.1007/978-3-540-70575-8\_4}, Organization = {Springer-Verlag}, Pages = {36--47}, Title = {Optimal Cryptographic Hardness of Learning Monotone Functions}, Year = {2008}, Bdsk-Url-1 = {http://dx.doi.org/10.1007/978-3-540-70575-8%5C_4}} @article{HIL+:99, Author = {J. H{\aa}stad and R. Impagliazzo and L. Levin and M. Luby}, Date-Modified = {2009-12-10 13:27:02 -0500}, Eprint = {sicomp:10.1137/S0097539793244708}, Journal = SIAMJComput, Number = {4}, Pages = {1364--1396}, Title = {A Pseudorandom Generator from any One-way Function}, Volume = {28}, Year = {1999}} @article{Valiant:84, Author = {L. G. Valiant}, Date-Modified = {2009-12-10 13:27:18 -0500}, Eprint = {acm:10.1145/1968.1972}, Journal = {Commun. ACM}, Number = {11}, Pages = {1134--1142}, Title = {A theory of the learnable}, Volume = {27}, Year = {1984}} @article{AKS:83, Author = {M. Ajtai and J. Koml{\'o}s and E. Szemer{\'e}di}, Date-Modified = {2009-12-10 13:19:09 -0500}, Doi = {10.1007/BF02579338}, Journal = Combinatorica, Number = {1}, Pages = {1--19}, Title = {An {$O(n \log n)$} sorting network}, Volume = {3}, Year = {1983}, Bdsk-Url-1 = {http://dx.doi.org/10.1007/BF02579338}} @article{LMN:93, Author = {N. Linial and Y. Mansour and N. Nisan}, Date-Modified = {2009-12-10 13:27:50 -0500}, Eprint = {jacm:10.1145/174130.174138}, Journal = JACM, Number = {3}, Pages = {607--620}, Title = {Constant depth circuits, {Fourier} transform and learnability}, Volume = {40}, Year = {1993}} @inproceedings{Kharitonov:93, Author = {M. Kharitonov}, Booktitle = {Proc. 25th FOCS}, Date-Modified = {2009-12-10 13:21:58 -0500}, Eprint = {focs:10.1109/SFCS.1993.366850}, Pages = {372--381}, Publisher = {IEEE Comp. Soc. Press}, Title = {Cryptographic hardness of distribution-specific learning}, Year = {1993}} @article{Kharitonov:95, Author = {M. Kharitonov}, Date-Modified = {2009-12-10 13:28:09 -0500}, Eprint = {jcss:10.1006/jcss.1995.1046}, Journal = JComputSystemSci, Number = 3, Pages = {600--610}, Title = {Cryptographic lower bounds for learnability of {Boolean} functions on the uniform distribution}, Volume = {50}, Year = {1995}} @article{Odonnell:02, Author = {O'Donnell, R.}, Date-Modified = {2009-12-10 13:21:16 -0500}, Eprint = {jcss:10.1016/j.jcss.2004.01.001}, Journal = JComputSystemSci, Number = {1}, Pages = {68--94}, Title = {Hardness amplification within {NP}}, Volume = {69}, Year = {2004}} @article{GGM84, Author = {O. Goldreich and S. Goldwasser and S. Micali}, Date-Modified = {2009-12-10 13:28:32 -0500}, Eprint = {jacm:10.1145/6490.6503}, Journal = JACM, Number = {4}, Pages = {792--807}, Title = {How to Construct Random Functions}, Volume = {33}, Year = {1986}} @article{KLV94, Author = {M. J. Kearns and M. Li and L. G. Valiant}, Date-Modified = {2009-12-10 13:28:53 -0500}, Eprint = {jacm:10.1145/195613.195656}, Journal = JACM, Number = {6}, Pages = {1298--1328}, Title = {Learning {Boolean} Formulas}, Volume = {41}, Year = {1994}} @inproceedings{Mansour:94, Author = {Y. Mansour}, Booktitle = {Theoretical Advances in Neural Computation and Learning}, Date-Modified = {2009-12-10 13:25:29 -0500}, Pages = {391--424}, Publisher = {Kluwer Academic Publishers}, Title = {Learning {Boolean} functions via the {Fourier} transform}, Url = {http://www.cs.tau.ac.il/~mansour/papers/fourier-survey.ps.gz}, Year = {1994}, Bdsk-Url-1 = {http://www.cs.tau.ac.il/~mansour/papers/fourier-survey.ps.gz}} @inproceedings{Verbeurgt:90, Author = {K. Verbeurgt}, Booktitle = {Proc. 3rd Ann. Workshop Comput. Learn. Theory}, Date-Modified = {2009-12-10 13:25:38 -0500}, Pages = {314--326}, Publisher = {Morgan Kaufman}, Title = {Learning {DNF} under the uniform distribution in quasi-polynomial time}, Year = {1990}} @article{MOS:04short, Author = {E. Mossel and R. O'Donnell and R. Servedio}, Date-Modified = {2009-12-10 13:29:13 -0500}, Eprint = {jcss:10.1016/j.jcss.2004.04.002}, Journal = JComputSystemSci, Number = {3}, Pages = {421--434}, Title = {Learning functions of {$k$} relevant variables}, Volume = {69}, Year = {2004}} @article{KOS:04short, Author = {A. Klivans and R. O'Donnell and R. Servedio}, Date-Modified = {2009-12-10 13:29:26 -0500}, Eprint = {jcss:10.1016/j.jcss.2003.11.002}, Journal = JComputSystemSci, Number = {4}, Pages = {808--840}, Title = {Learning intersections and thresholds of halfspaces}, Volume = {68}, Year = {2004}} @article{OdonnellServedio:07, Author = {R. O'Donnell and R. Servedio}, Date-Modified = {2009-12-10 13:29:35 -0500}, Eprint = {sicomp:10.1137/060669309}, Journal = SIAMJComput, Number = {3}, Pages = {827--844}, Title = {Learning monotone decision trees in polynomial time}, Volume = {37}, Year = {2007}} @inproceedings{Trevisan:03, Author = {Trevisan, L.}, Booktitle = {Proc. 44th FOCS}, Date-Modified = {2009-12-10 13:22:32 -0500}, Eprint = {focs:10.1109/SFCS.2003.1238187}, Pages = {126--135}, Publisher = {IEEE Comp. Soc. Press}, Title = {List decoding using the {XOR} lemma}, Year = {2003}} @article{Razborov:85b, Author = {A. Razborov}, Date-Modified = {2009-12-10 13:29:49 -0500}, Journal = MatZametki, Note = {English translation in \emph{Math.~Notes of the Academy of Sciences of the USSR}, Vol 37, pp.~485-493, 1985.}, Pages = {887--900}, Title = {Lower Bounds on the Monotone Network Complexity of the Logical Permanent}, Volume = {37}, Year = {1985}} @inproceedings{AHM+:06, Author = {E. Allender and L. Hellerstein and P. McCabe and T. Pitassi and M. Saks}, Booktitle = {Proc. 21st IEEE Conf. Comput. Complex. (CCC)}, Date-Modified = {2009-12-10 13:23:10 -0500}, Eprint = {ccc:10.1109/CCC.2006.27}, Pages = {237--251}, Publisher = {IEEE Comp. Soc. Press}, Title = {Minimizing {DNF} Formulas and {$AC^0_d$} Circuits Given a Truth Table}, Year = {2006}} @inproceedings{FGK+:06, Author = {V. Feldman and P. Gopalan and S. Khot and A. Ponnuswami}, Booktitle = {Proc. 47th FOCS}, Date-Modified = {2009-12-10 13:23:44 -0500}, Eprint = {focs:10.1109/FOCS.2006.51}, Pages = {563--576}, Publisher = {IEEE Comp. Soc. Press}, Title = {New Results for Learning Noisy Parities and Halfspaces}, Year = {2006}} @article{BKS:99, Author = {I. Benjamini and G. Kalai and O. Schramm}, Date-Modified = {2009-12-10 13:30:29 -0500}, Journal = PublMathInstHautesEtudesSci, Pages = {5--43}, Title = {Noise sensitivity of {Boolean} functions and applications to percolation}, Volume = {90}, Year = {1999}} @article{NaorReingold:04, Author = {M. Naor and O. Reingold}, Date-Modified = {2009-12-10 13:30:49 -0500}, Eprint = {jacm:10.1145/972639.972643}, Journal = JACM, Number = {2}, Pages = {231--262}, Title = {Number-theoretic constructions of efficient pseudo-random functions}, Volume = {51}, Year = {2004}} @inproceedings{BBL:98, Author = {A. Blum and C. Burch and J. Langford}, Booktitle = {Proc. 39th FOCS}, Date-Modified = {2009-12-10 13:34:26 -0500}, Eprint = {focs:10.1109/SFCS.1998.743491}, Pages = {408--415}, Publisher = {IEEE Comp. Soc. Press}, Title = {On Learning Monotone {Boolean} Functions}, Year = {1998}} @article{Servedio:04iandcshort, Author = {R. Servedio}, Date-Modified = {2009-12-10 13:31:15 -0500}, Journal = {Inform. Comput.}, Number = {1}, Pages = {57--74}, Title = {On learning monotone {DNF} under product distributions}, Volume = {193}, Year = {2004}} @techreport{berkowitz308srb, Author = {Berkowitz, S. J.}, Date-Modified = {2009-12-10 13:31:20 -0500}, Institution = {Technical Report, University of Toronto}, Title = {On some relationships between monotone and non-monotone circuit complexity}, Year = {1982}} @article{BshoutyTamon:96, Author = {N. Bshouty and C. Tamon}, Date-Modified = {2009-12-10 13:31:45 -0500}, Eprint = {jacm:10.1145/234533.234564}, Journal = JACM, Number = {4}, Pages = {747--770}, Title = {On the {Fourier} spectrum of monotone functions}, Volume = {43}, Year = {1996}} @inproceedings{GGN:03, Author = {O. Goldreich and S. Goldwasser and A. Nussboim}, Booktitle = {Proc. 44th FOCS}, Date-Modified = {2009-12-10 13:24:40 -0500}, Eprint = {focs:10.1109/SFCS.2003.1238182}, Pages = {68--79}, Publisher = {IEEE Comp. Soc. Press}, Title = {On the Implementation of Huge Random Objects}, Year = {2003}} @article{MO03, Author = {E. Mossel and R. O'Donnell}, Date-Modified = {2009-12-10 13:31:57 -0500}, Eprint = {wiley:10.1002/rsa.10097}, Journal = RandomStructuresAlgorithms, Number = {3}, Pages = {333--350}, Title = {On the noise sensitivity of monotone functions}, Volume = {23}, Year = {2003}} @article{Nepomnjascii:70a, Author = {V. A. Nepomnja{\v s}{\v c}i{\u \i}}, Date-Modified = {2009-12-10 13:32:31 -0500}, Journal = {Soviet Mathematics Doklady}, Note = {Math. Reviews MR02811611 (43{\#}7326)}, Pages = {1642--1645}, Title = {Rudimentary predicates and {Turing} computations ({English} translation)}, Volume = {11}, Year = {1970}} @article{Nepomnjascii:70, Author = {V. A. Nepomnja{\v s}{\v c}i{\u \i}}, Date-Modified = {2009-12-10 13:32:23 -0500}, Journal = {Dokl. Akad. Nauk SSSR}, Note = {English translation in \emph{Soviet Mathematics Doklady}, Vol.~11, pp.~1642--1645, 1970. \emph{Math. Reviews} MR02811611 (43{\#}7326)}, Pages = {282-284}, Title = {Rudimentary predicates and {Turing} computations (in {Russian})}, Volume = {195}, Year = {1970}} @inproceedings{KKL:88, Author = {J. Kahn and G. Kalai and N. Linial}, Booktitle = {Proc. 29th FOCS}, Date-Modified = {2009-12-10 13:25:06 -0500}, Eprint = {focs:10.1109/SFCS.1988.21923}, Pages = {68--80}, Publisher = {IEEE Comp. Soc. Press}, Title = {The influence of variables on {Boolean} functions}, Year = {1988}} @article{healy2006una, Author = {Healy, A. and Vadhan, S. and Viola, E.}, Date-Modified = {2009-12-10 13:37:20 -0500}, Eprint = {sicomp:10.1137/S0097539705447281}, Journal = SIAMJComput, Number = {4}, Pages = {903--931}, Publisher = {Society for Industrial and Applied Mathematics Philadelphia, PA, USA}, Title = {Using Nondeterminism to Amplify Hardness}, Volume = {35}, Year = {2006}} @inproceedings{KLNRS-2008, Author = {S. Kasiviswanathan and {H. K.} Lee and K. Nissim and S. Raskhodnikova and A. Smith}, Booktitle = {Proc. 49th FOCS}, Date-Modified = {2009-12-10 13:20:16 -0500}, Eprint = {focs:10.1109/FOCS.2008.27}, Pages = {531--540}, Publisher = {IEEE Comp. Soc. Press}, Title = {What Can We Learn Privately?}, Year = 2008} @article{tardos1988gap, Author = {Tardos, {\'E}.}, Date-Modified = {2009-12-10 20:58:22 -0500}, Eprint = {springer:10.1007/BF02122563}, Journal = Combinatorica, Number = {1}, Pages = {141--142}, Publisher = {Springer}, Title = {The Gap Between Monotone and Non-monotone Circuit Complexity is Exponential}, Volume = {8}, Year = {1988}} @article{valiant1986npb, Author = {Valiant, L. G.}, Date-Modified = {2009-12-10 13:26:01 -0500}, Eprint = {sicomp:10.1137/0215037}, Journal = SIAMJComput, Pages = {531--535}, Title = {Negation is Powerless for {Boolean} Slice Functions}, Volume = {15}, Year = {1986}} @article{beals1998cnl, Author = {Beals, R. and Nishino, T. and Tanaka, K.}, Date-Modified = {2009-12-10 13:33:48 -0500}, Eprint = {sicomp:10.1137/S0097539794275136}, Journal = SIAMJComput, Number = {5}, Pages = {1334--1347}, Publisher = {Society for Industrial and Applied Mathematics Philadelphia, PA, USA}, Title = {On the Complexity of Negation-Limited {Boolean} Networks}, Volume = {27}, Year = {1998}} %%%%%%%%%%%%%%%%%%%%%%%%%% %%%%% bib of v006a001 %%%%%%%%%%%%%%%%%%%%%%%%%% %% This BibTeX bibliography file was created using BibDesk. %% http://bibdesk.sourceforge.net/ %% Created for Alexander Russell at 2010-01-11 11:30:02 -0500 %% Saved with string encoding Unicode (UTF-8) @comment{Journal of the ACM} @comment{SIAM Journal on Computing} @comment{Journal of Computer and System Sciences} @comment{Algorithmica. An International Journal in Computer Science} @comment{Theoretical Computer Science} @comment{Institute of Electrical and Electronics Engineers. Transactions on Information Theory} @comment{Theory of Computing. An Open Access Journal} @comment{Annals of Mathematics.} @comment{Israel Journal of Mathematics} @comment{Proceedings of the American Mathematical Society} @comment{Advances in Applied Mathematics} @comment{Combinatorics, Probability and Computing} @comment{American Journal of Mathematics} @comment{Geometric and Functional Analysis} @comment{The Annals of Probability} @comment{Journal of the ACM} @string{advinapplmath = {Adv. in Appl. Math.}} @string{algorithmica = {Algorithmica}} @string{amerjmath = {Amer. J. Math.}} @string{annofmath = {Ann. of Math.}} @string{annprobab = {Ann. Probab.}} @string{combinprobabcomput = {Combin. Probab. Comput.}} @string{geomfunctanal = {Geom. Funct. Anal.}} @string{ieeetransinformtheory = {IEEE Trans. Inform. Theory}} @string{israeljmath = {Israel J. Math.}} @string{jacm = {J. ACM}} @string{jcomputsystemsci = {J. Comput. System Sci.}} @string{procamermathsoc = {Proc. Amer. Math. Soc.}} @string{siamjc = {SIAM J. Comput.}} @string{theoretcomputsci = {Theoret. Comput. Sci.}} @string{theorycomput = {Theory of Computing}} @article{aar:adv, Author = {S. Aaronson}, Date-Modified = {2010-01-11 11:28:30 -0500}, Eprint = {toc:v001/a001,arxiv:quant-ph/0402095}, Journal = TheoryComput, Note = {Conference version in CCC'2004}, Pages = {1--28}, Title = {Limitations of Quantum Advice and One-way Communication}, Volume = {1}, Year = {2005}} @article{as:collision, Author = {S. Aaronson and Y. Shi}, Date-Modified = {2010-01-11 11:29:45 -0500}, Eprint = {jacm:1008731.1008735}, Journal = JACM, Number = 4, Pages = {595--605}, Title = {Quantum Lower Bounds for the Collision and the Element Distinctness Problems}, Volume = {51}, Year = {2004}} @article{ambainis:lowerb, Author = {A. Ambainis}, Date-Modified = {2010-01-11 11:29:35 -0500}, Eprint = {jcss:10.1006/jcss.2002.1826,stoc:335305.335394,arxiv:quant-ph/0002066}, Journal = JComputSystemSci, Note = {Conference version in STOC'00}, Number = 4, Pages = {750--767}, Title = {Quantum Lower Bounds by Quantum Arguments}, Volume = {64}, Year = {2002}} @article{ambainis:poly, Author = {A. Ambainis}, Date-Modified = {2010-01-11 11:28:47 -0500}, Eprint = {jcss:10.1016/j.jcss.2005.06.006, focs:10.1109/SFCS.2003.1238197,arxiv:quant-ph/0305028}, Journal = JComputSystemSci, Note = {Conference version in FOCS'03}, Number = 2, Pages = {220--238}, Title = {Polynomial Degree {vs.} Quantum Query Complexity}, Volume = {72}, Year = {2006}} @article{ambainis:element-siam, Author = {A. Ambainis}, Date-Modified = {2010-01-11 11:29:55 -0500}, Eprint = {sicomp:10.1137/S0097539705447311, arxiv:quant-ph/0311001}, Journal = siamjc, Note = {Conference version in FOCS'04}, Number = {1}, Pages = {210--239}, Title = {Quantum Walk Algorithm for Element Distinctness}, Volume = {37}, Year = {2007}} @inproceedings{aswSTOC, Author = {A. Ambainis and R. \v{S}palek and R. de Wolf}, Booktitle = {Proc. 38th STOC}, Eprint = {stoc:10.1145/1132516.1132604}, Pages = {618--633}, Publisher = {ACM Press}, Title = {A new quantum lower bound method, with applications to direct product theorems and time-space tradeoffs}, Year = 2006} @article{asw, Author = {A. Ambainis and R. \v{S}palek and R. de Wolf}, Comment = {algorithmica:10.1007/s00453-007-9022-9, quant-ph/0511200}, Journal = Algorithmica, Number = 3, Pages = {422--461}, Title = {Quantum direct product theorems for symmetric functions and time-space tradeoffs}, Volume = {55}, Year = {2009}} @inproceedings{bss:semidef, Author = {H. Barnum and M. Saks and M. Szegedy}, Booktitle = {Proc. 18th IEEE Conf. on Comput. Complex. (CCC'03)}, Eprint = {ccc:10.1109/CCC.2003.1214419}, Pages = {179--193}, Publisher = {IEEE Press}, Title = {Quantum decision trees and semidefinite programming}, Year = {2003}} @article{bbcmw:polynomialsj, Author = {R. Beals and H. Buhrman and R. Cleve and M. Mosca and R. de Wolf}, Date-Modified = {2010-01-11 11:29:26 -0500}, Eprint = {jacm:502090.502097,focs:10.1109/SFCS.1998.743485,arxiv:quant-ph/9802049}, Journal = JACM, Note = {Conference version in FOCS'98}, Number = 4, Pages = {778--797}, Title = {Quantum Lower Bounds by Polynomials}, Volume = 48, Year = 2001} @article{BernVaz, Author = {Bernstein, E. and Vazirani, U.}, Date-Modified = {2010-01-11 11:29:02 -0500}, Eprint = {sicomp:10.1137/S0097539796300921}, Journal = siamjc, Number = {5}, Pages = {1411--1473}, Title = {Quantum Complexity Theory}, Volume = {26}, Year = {1997}} @inproceedings{Counting, Author = {G. Brassard and P. H\o yer and A. Tapp}, Booktitle = {Proc. 25th Intern. Conf. Automata, Languages and Programming (ICALP'98)}, Date-Modified = {2010-01-11 11:29:12 -0500}, Eprint = {icalp:ap2mrf08d8gcqppe, quant-ph/9805082}, Pages = {820--831}, Publisher = {Springer}, Series = {LNCS}, Title = {Quantum Counting}, Volume = {1443}, Year = {1998}} @article{bw, Author = {H. Buhrman and R. de Wolf}, Eprint = {tcs:10.1016/S0304-3975(01)00144-X}, Journal = TheoretComputSci, Pages = {21--43}, Title = {Complexity measures and decision tree complexity: {A} survey}, Url = {http://homepages.cwi.nl/~rdewolf/publ/qc/dectree.ps}, Volume = {288}, Year = {2002}, Bdsk-Url-1 = {http://homepages.cwi.nl/~rdewolf/publ/qc/dectree.ps}} @inproceedings{Grover, Author = {L. Grover}, Booktitle = {Proc. 28th STOC}, Eprint = {stoc:237814.237866, quant-ph/9605043}, Pages = {212--219}, Publisher = {ACM Press}, Title = {A fast quantum mechanical algorithm for database search}, Year = 1996} @inproceedings{hls:negative, Author = {P. H{\o}yer and T. Lee and R. \v{S}palek}, Booktitle = {Proc. 39th STOC}, Eprint = {stoc:10.1145/1250790.1250867}, Pages = {526--535}, Publisher = {ACM Press}, Title = {Negative weights make adversaries stronger}, Year = {2007}} @article{HNS, Author = {P. Hoyer and J. Neerbek and Y. Shi}, Eprint = {algorithmica:25gl9elr5rxr3q6a, quant-ph/0102078}, Journal = Algorithmica, Note = {Conference version at ICALP'01}, Pages = {429--448}, Title = {Quantum lower bounds of ordered searching, sorting and element distinctness}, Volume = 34, Year = 2002} @article{ksw:journal, Author = {H. Klauck and R. \v{S}palek and R. de Wolf}, Eprint = {sicomp:10.1137/05063235X, focs:10.1109/FOCS.2004.52, quant-ph/0402123}, Journal = siamjc, Note = {Conference version at FOCS'04}, Number = 5, Pages = {1472--1493}, Title = {Quantum and classical strong direct product theorems and optimal time-space tradeoffs}, Volume = 36, Year = 2007} @incollection{knuth, Author = {D. Knuth}, Booktitle = {Selected Papers on Discrete Mathematics, CSLI Lecture Notes, no. 106}, Publisher = {University of Chicago Press}, Title = {Combinatorial matrices}, Year = 2003} @article{lm:kolmogorov-journal, Author = {S. Laplante and F. Magniez}, Eprint = {sicomp:10.1137/050639090, ccc:10.1109/CCC.2004.1313852,arxiv:quant-ph/0311189}, Journal = siamjc, Note = {Conference version at CCC'04}, Number = 1, Pages = {46--62}, Title = {Lower bounds for randomized and quantum query complexity using {Kolmogorov} arguments}, Volume = 38, Year = 2008} @article{lov:shannon, Author = {L. Lov\'asz}, Journal = IEEETransInformTheory, Pages = {1--7}, Title = {On the {Shannon} capacity of a graph}, Volume = {25}, Year = 1979} @article{mss:triangle-journal, Author = {F. Magniez and M. Santha and M. Szegedy}, Eprint = {sicomp:10.1137/050643684, arxiv:quant-ph/0310134}, Journal = siamjc, Note = {Conference version at SODA'05}, Number = {2}, Pages = {413--424}, Title = {Quantum algorithms for the triangle problem}, Volume = {37}, Year = {2007}} @inproceedings{nayak, Author = {A. Nayak}, Booktitle = {Proc. 40th FOCS}, Eprint = {focs:10.1109/SFFCS.1999.814608, quant-ph/9904093}, Pages = {369--377}, Publisher = {IEEE Press}, Title = {Optimal lower bounds for quantum automata and random access codes}, Year = {1999}} @unpublished{reichardt:span, Author = {B. Reichardt}, Eprint = {arXiv:0904.2759}, note = {Quant-ph, arXiv:0904.2759}, Title = {Span programs and quantum query complexity: {The} general adversary bound is nearly tight for every {Boolean} functionnote}, Year = 2009} @inproceedings{spalek:multiplicative, Author = {R. \v{S}palek}, Booktitle = {Proc. 23rd IEEE Conf. on Comput. Complex.}, Eprint = {ccc:10.1109/CCC.2008.9}, Pages = {237--248}, Publisher = {IEEE Press}, Title = {The multiplicative quantum adversary}, Year = {2008}} @article{ss:adversary, Author = {R. \v{S}palek and M. Szegedy}, Date-Modified = {2010-01-11 11:28:15 -0500}, Eprint = {toc:v002/a001, quant-ph/0409116}, Journal = TheoryComput, Note = {Conference version at ICALP'05}, Number = {1}, Pages = {1--18}, Title = {All Quantum Adversary Methods are Equivalent}, Volume = {2}, Year = {2006}} @article{zhang:ambainis, Author = {S. Zhang}, Commbooktitle = {Proc. of 31st ICALP}, Comment = {quant-ph/0311060}, Commpages = {1238--1250}, Commyear = {2004}, Eprint = {tcs:10.1016/j.tcs.2005.01.019,icalp:gm2ff6wpc0q39v3x,arxiv:quant-ph/0311060}, Journal = TheoretComputSci, Note = {Conference version in ICALP'04}, Number = {2--3}, Pages = {241--256}, Title = {On the power of {Ambainis}'s lower bounds}, Volume = 339, Year = 2005} %%%%%%%%%%%%%%%%%%%%%%%%%% %%%%% bib of v006a002 %%%%%%%%%%%%%%%%%%%%%%%%%% %% Theory of Computing %% File: v006a002.bib %% Publication date: February 15, 2010 %% Authors: Matthias Englert, Harald Raecke, and Matthias Westermann %% Theory of Computing %% File: v006a002.bib %% Publication date: March 3, 2010 %% Authors: Matthias Englert, Harald Raecke, and Matthias Westermann @String{proc = "Proc. "} @String{focs = " FOCS"} @String{stoc = " STOC"} @String{soda = " ACM-SIAM Symp. on Discrete Algorithms (SODA)"} @String{esa = " European Symp. on Algorithms (ESA)"} @String{icalp = " Internat. Colloquium on Automata, Languages and Programming (ICALP)"} @String{stacs = " Symp. on Theoretical Aspects of Computer Science (STACS)"} @String{vmv = " Internat. Fall Workshop Vision, Modeling, and Visualization (VMV)"} @String{wea = " Internat. Workshop on Efficient and Experimental Algorithms (WEA)"} @String{latin = " Latin American Symp. on Theoretical Informatics (LATIN)"} @String{waoa = " Workshop on Approximation and Online Algorithms (WAOA)"} @String{jcss = "J. Comput. System Sci."} @String{cacm = "Comm. ACM"} @String{jalgo = "J. Algorithms"} @String{jdalgo = "J. Discrete Algorithms"} @String{acm = "ACM Press"} @String{ieee = "IEEE Comp. Soc. Press"} @String{springer = "Springer"} @String{lncs = "Lecture Notes in Computer Science"} @MastersThesis{Aboud08, author = {Amjad Aboud}, title = {Correlation Clustering with Penalties and Approximating the Recordering Buffer Management Problem}, school = {The Technion - Israel Institute of Technology}, year = {2008}, month = {Janurary}, note = {\href{http://www.cs.technion.ac.il/users/wwwb/cgi-bin/tr-info.cgi/2008/MSC/MSC-2008-07}{[Technion TR archive]}}, } @InProceedings{AR10, author = "Noa Avigdor-Elgrabli and Yuval Rabani", title = "An Improved Competitive Algorithm for Reordering Buffer Management", booktitle = proc # "21st" # soda, year = {2010}, publisher = acm, pages = "13--21", } @InProceedings{GS07, author = "Iftah Gamzu and Danny Segev", title = "Improved Online Algorithms for the Sorting Buffer Problem", booktitle = proc # "24th" # stacs, pages = "658--669", year = "2007", series = lncs, volume = 4393, publisher = springer, doi = "10.1007/978-3-540-70918-3\_56" } @Article{KP08, author = "Rohit Khandekar and Vinayaka Pandit", title = "Online and Offline Algorithms for the Sorting Buffers Problem on the Line Metric", journal = jdalgo, year = "2008", doi = "10.1016/j.jda.2008.08.002", } @InProceedings{EOW08, author = "Matthias Englert and Deniz {\"O}zmen and Matthias Westermann", title = "The Power of Reordering for Online Minimum Makespan Scheduling", booktitle = proc # "49th" # focs, publisher = ieee, pages = "603--612", year = "2008", doi = "10.1109/FOCS.2008.46" } @Article{ATU+01, author = "Houman Alborzi and Eric Torng and Patchrawat Uthaisombut and Stephen Wagner", title = "The $k$-Client Problem", journal = jalgo, volume = "41", number = "2", pages = "115--173", year = "2001", doi = "10.1006/jagm.2001.1182", } @InProceedings{ERW06, author = "Matthias Englert and Heiko R{\"o}glin and Matthias Westermann", title = "Evaluation of Online Strategies for Reordering Buffers", booktitle = proc # "5th" # wea, publisher = springer, series = lncs, volume = 4007, pages = "183--194", year = "2006", doi = "10.1007/11764298\_17", } @Article{GSV04, author = "Kai Gutenschwager and Sven Spiekermann and Stefan Vo{\ss}", title = "A Sequential Ordering Problem in Automotive Paint Shops", journal = "Internat. J. Production Research", volume = "42", number = "9", pages = "1865--1878", year = "2004", doi = "10.1080/00207540310001646821", } @InProceedings{BL05, author = "Reuven {Bar-Yehuda} and Jonathan Laserson", title = "Exploiting Locality: Approximating Sorting Buffers", booktitle = proc # "3rd" # waoa, pages = "69--81", year = "2005", series = lncs, volume = 3879, publisher = springer, doi = "10.1007/11671411\_6", } @InProceedings{Bar96, author = "Yair Bartal", title = "Probabilistic Approximations of Metric Spaces and its Algorithmic Applications", booktitle = proc # "37th" # focs, publisher = ieee, pages = "184--193", year = "1996", doi = "10.1109/SFCS.1996.548477", } @InProceedings{Bar98, author = "Yair Bartal", title = "On Approximating Arbitrary Metrics by Tree Metrics", booktitle = proc # "30th" # stoc, publisher = acm, pages = "161--168", year = "1998", doi = "10.1145/276698.276725", } @InProceedings{EW05, author = "Matthias Englert and Matthias Westermann", title = "Reordering Buffer Management for Non-Uniform Cost Models", booktitle = proc # "32nd" # icalp, pages = "627--638", publisher = springer, series = lncs, volume = 3580, year = "2005", doi = "10.1007/11523468\_51", } @Article{FRT04, author = "Jittat Fakcharoenphol and Satish B. Rao and Kunal Talwar", title = "A Tight Bound on Approximating Arbitrary Metrics by Tree Metrics", journal = jcss, volume = "69", number = "3", pages = "485--497", year = "2004", doi = "10.1016/j.jcss.2004.04.011", } @InProceedings{KP04, author = "Jens S. Kohrt and Kirk Pruhs", title = "A Constant Factor Approximation Algorithm for Sorting Buffers", booktitle = proc # "6th" # latin, pages = "193--202", year = "2004", publisher = springer, series = lncs, volume = 2976, eprint = "latin:fqbc84923gveuhlr", } @Article{TP72, author = "Toby J. Teorey and Tad B. Pinkerton", title = "A Comparative Analysis of Disk Scheduling Policies", journal = cacm, volume = "15", number = "3", pages = "177--184", year = "1972", doi = "10.1145/361268.361278", } @InProceedings{KRSW04, author = "Jens Krokowski and Harald R{\"a}cke and Christian Sohler and Matthias Westermann", title = "Reducing State Changes with a Pipeline Buffer", booktitle = proc # "9th" # vmv, pages = "217--224", year = "2004", location = "Stanford", publisher = "Aka GmbH", nops = "1", nopsgz = "1", } @InProceedings{RSW02, author = "Harald R{\"a}cke and Christian Sohler and Matthias Westermann", title = "Online Scheduling for Sorting Buffers", booktitle = proc # "10th" # esa, pages = "820--832", year = "2002", publisher = springer, series = lncs, volume = 2461, directory = "02\_esa/final", filename = "sorting\_buffer", location = "Rome", eprint = "esa:mx7mdle1j62b5n3h", doi = "10.1007/3-540-45749-6\_71" } %%%%%%%%%%%%%%%%%%%%%%%%%% %%%%% bib of v006a003 %%%%%%%%%%%%%%%%%%%%%%%%%% %% This BibTeX bibliography file was created using BibDesk. %% http://bibdesk.sourceforge.net/ %% Created for Alexander Russell at 2010-04-30 15:28:54 -0400 %% Saved with string encoding Unicode (UTF-8) @comment{American Journal of Mathematics} @comment{Combinatorica. An International Journal on Combinatorics and the Theory of Computing} @comment{Journal of Combinatorial Theory. Series B} @comment{Annals of Mathematics} @comment{Memoirs of the American Mathematical Society} @comment{Random Structures & Algorithms} @comment{Journal of the ACM} @comment{Rossiiskaya Akademiya Nauk. Problemy Peredachi Informatsii} @comment{Discrete Mathematics} @comment{Journal of Computer and System Sciences} @comment{bulletin of the AMS} @comment{Canadian Journal of Mathematics. Journal Canadien de Mathematiques} @comment{Physical Review A} @comment{Physical Review B} @comment{Quantum Information & Computation} @comment{Transactions of the American Mathematical Society} @comment{SIAM Journal on Computing} @comment{Experimental Mathematics} @comment{Electronic Research Announcements of the American Mathematical Society} @string{acm = {ACM Press}} @string{amerjmath = {Amer. J. Math.}} @string{ams = {American Mathematical Society}} @string{annofmath = {Ann. of Math.}} @string{bulletin = {Bull. Amer. Math. Soc.}} @string{canadjmath = {Canad. J. Math.}} @string{combinatorica = {Combinatorica}} @string{discretemath = {Discrete Math.}} @string{electronresannouncamermathsoc = {Electron. Res. Announc. Amer. Math. Soc.}} @string{experimentmath = {Experiment. Math.}} @string{ieee = {IEEE Comp. Soc. Press}} @string{jacm = {J. ACM}} @string{jcombintheoryserb = {J. Combin. Theory Ser. B}} @string{jcomputsystemsci = {J. Comput. System Sci.}} @string{memamermathsoc = {Mem. Amer. Math. Soc.}} @string{physreva = {Phys. Rev. A}} @string{physrevb = {Phys. Rev. B}} @string{problemyperedachiinformatsii = {Problemy Peredachi Informatsii}} @string{quantuminfcomput = {Quantum Inf. Comput.}} @string{randomstructuresalgorithms = {Random Structures Algorithms}} @string{siamjcomput = {SIAM J. Comput.}} @string{springer = {Springer-Verlag}} @string{springeraddr = {New York, NY}} @string{transamermathsoc = {Trans. Amer. Math. Soc.}} @article{A86, Author = {Noga Alon}, Date-Modified = {2010-04-29 15:10:07 -0400}, Eprint = {springer:90541164662405r4}, Journal = Combinatorica, Number = 2, Pages = {83--96}, Title = {Eigenvalues and expanders}, Volume = 6, Year = 1986} @article{AM85, Author = {N. Alon and V. D. Milman}, Date-Modified = {2010-04-29 15:07:42 -0400}, Eprint = {elsevier:10.1016/0095-8956(85)90092-9}, Journal = JCombinTheorySerB, Number = 1, Pages = {73--88}, Title = {{$\lambda_1$}, isoperimetric inequalities for graphs, and superconcentrators}, Volume = 38, Year = 1985} @article{AR94, Author = {Noga Alon and Yuval Roichman}, Date-Modified = {2010-04-30 12:25:13 -0400}, Eprint = {wiley:10.1002/rsa.3240050203}, Journal = RandomStructuresAlgorithms, Number = 2, Pages = {271--285}, Title = {Random {Cayley} Graphs and Expanders}, Volume = 5, Year = 1994} @article{ANTV02, Author = {Andris Ambainis and Ashwin Nayak and Amnon Ta{-}Shma and Umesh Vazirani}, Date-Modified = {2010-04-29 15:11:59 -0400}, Eprint = {jacm:10.1145/581771.581773}, Journal = JACM, Number = 4, Pages = {496--511}, Title = {Quantum dense coding and quantum finite automata}, Volume = 49, Year = 2002} @inproceedings{AS04, Author = {Andris Ambainis and Adam Smith}, Booktitle = {Proc. 8th Intern. Workshop Randomization and Comput.}, Date-Modified = {2010-04-29 15:15:32 -0400}, Doi = {10.1007/b99805}, Pages = {249--260}, Publisher = springer, Series = {LNCS}, Title = {Small Pseudo-random Families of Matrices: {Derandomizing} Approximate Quantum Encryption}, Volume = {3122}, Year = 2004, Bdsk-Url-1 = {http://dx.doi.org/10.1007/b99805}} @inproceedings{B97, Author = {Robert Beals}, Booktitle = {Proc. 29th {STOC}}, Date-Modified = {2010-04-29 15:15:54 -0400}, Eprint = {stoc:10.1145/258533.258548}, Pages = {48--53}, Publisher = acm, Title = {Quantum computation of {Fourier} transforms over symmetric groups}, Year = 1997} @techreport{BT07, Author = {Avraham Ben{-}Aroya and Amnon Ta{-}Shma}, Date-Modified = {2010-04-29 15:16:24 -0400}, Eprint = {arxiv:quant-ph/0702129}, Institution = {arXiv:quant-ph/0702129}, Title = {Quantum expanders and the quantum entropy difference problem}, Year = 2007} @inproceedings{CRVW02, Author = {Michael Capalbo and Omer Reingold and Salil Vadhan and Avi Wigderson}, Booktitle = {Proc. 34th {STOC}}, Date-Modified = {2010-04-29 15:16:56 -0400}, Eprint = {stoc:10.1145/509907.510003}, Pages = {659--668}, Publisher = acm, Title = {Randomness Conductors and Constant-Degree Lossless Expanders}, Year = 2002} @article{Dod84, Author = {Jozef Dodziuk}, Date-Modified = {2010-04-29 15:18:45 -0400}, Journal = TransAmerMathSoc, Note = {\url{http://www.jstor.org/stable/1999107}}, Number = 2, Pages = {787--794}, Title = {Difference equations, isoperimetric inequality and transience of certain random walks.}, Volume = 284, Year = 1984} @article{dn:skalgorithm, Author = {C. M. Dawson and M. A. Nielsen}, Date-Modified = {2010-04-29 15:18:02 -0400}, Journal = QuantumInfComput, Number = 1, Pages = {81--95}, Title = {The {Solovay}-{Kitaev} algorithm}, Volume = 6, Year = 2006} @inproceedings{DN06, Author = {Paul Dickinson and Ashwin Nayak}, Booktitle = {Proc. AIP Conf.}, Date-Modified = {2010-04-30 15:28:47 -0400}, Pages = {18--36}, Publisher = {AIP}, Title = {Approximate Randomization of Quantum States with Fewer Bits of Key}, Volume = 864, Year = 2006} @article{GG81, Author = {Ofer Gabber and Zvi Galil}, Date-Modified = {2010-04-29 15:19:18 -0400}, Eprint = {jcss:10.1016/0022-0000(81)90040-4}, Journal = JComputSystemSci, Number = {3}, Pages = {407--420}, Title = {Explicit Constructions of Linear-Sized Superconcentrators}, Volume = {22}, Year = {1981}} @article{GrossE08, Author = {D. Gross and J. Eisert}, Journal = QuantumInfComput, Number = {8\&9}, Pages = {722--733}, Title = {Quantum {Margulis} expanders}, Volume = 8, Year = 2008} @techreport{GE07, Author = {D. Gross and J. Eisert}, Eprint = {arXiv:quant-ph/0710.0651}, Institution = {arXiv:0710.0651}, Title = {Quantum {Margulis} expanders}, Year = 2007} @article{Hastings07, Author = {M. B. Hastings}, Date-Modified = {2010-04-29 15:23:51 -0400}, Eprint = {prb:10.1103/PhysRevB.76.035114}, Journal = PhysRevB, Number = 3, Pages = 035114, Title = {Entropy and Entanglement in Quantum Ground States}, Volume = 76, Year = 2007} @article{Hastings07b, Author = {M. B. Hastings}, Date-Modified = {2010-04-29 15:23:58 -0400}, Eprint = {pra:10.1103/PhysRevA.76.032315}, Journal = PhysRevA, Number = 3, Pages = 032315, Title = {Random unitaries give quantum expanders}, Volume = 76, Year = 2007} @techreport{Harrow07, Author = {A.W. Harrow}, Date-Modified = {2010-04-14 14:04:37 -0400}, Eprint = {arxiv:quant-ph/0709.1142}, Institution = {arXiv:0709.1142}, Title = {Quantum expanders from any classical {Cayley} graph expander}, Year = 2007} @article{Harrow08, Author = {A.W. Harrow}, Date-Modified = {2010-04-14 14:04:47 -0400}, Journal = QuantumInfComput, Number = {8\&9}, Pages = {715--721}, Title = {Quantum expanders from any classical {Cayley} graph expander}, Volume = 8, Year = 2008} @techreport{HH08, Author = {M. B. Hastings and A. W. Harrow}, Date-Modified = {2010-04-29 15:24:06 -0400}, Eprint = {arxiv:quant-ph/0804.0011}, Institution = {arXiv:0804.0011}, Title = {Classical and Quantum Tensor Product Expanders}, Year = 2008} @article{HastingsH09, Author = {M.B. Hastings and A.W. Harrow}, Journal = QuantumInfComput, Number = {3\&4}, Pages = {336--360}, Title = {Classical and Quantum Tensor Product Expanders}, Volume = 9, Year = 2009} @article{HLW06, Author = {Schlomo Hoory and Nathan Linial and Avi Wigderson}, Date-Modified = {2010-04-29 15:25:32 -0400}, Doi = {10.1090/S0273-0979-06-01126-8}, Journal = bulletin, Number = 4, Pages = {439--561}, Title = {Expander graphs and their applications}, Volume = 43, Year = 2006, Bdsk-Url-1 = {http://dx.doi.org/10.1090/S0273-0979-06-01126-8}} @book{KitaevShen02, Author = {Kitaev, A. and Shen, A. and Vyalyi, M.}, Publisher = ams, Title = {Classical and Quantum Computation}, Year = 2002} @article{K95, Author = {Nabil Kahale}, Date-Modified = {2010-04-29 15:27:14 -0400}, Eprint = {jacm:10.1145/210118.210136}, Journal = JACM, Number = 5, Pages = {1091--1106}, Publisher = {ACM Press New York, NY, USA}, Title = {Eigenvalues and expansion of regular graphs}, Volume = 42, Year = 1995} @article{M73, Author = {G. A. Margulis}, Date-Modified = {2010-04-30 15:15:18 -0400}, Journal = ProblemyPeredachiInformatsii, Note = {\url{http://mi.mathnet.ru/eng/ppi925}}, Number = 4, Pages = {71--80}, Title = {Explicit constructions of expanders}, Volume = 9, Year = 1973} @article{N91, Author = {A. Nilli}, Eprint = {elsevier:10.1016/0012-365X(91)90112-F}, Journal = DiscreteMath, Number = 2, Pages = {207--210}, Title = {On the second eigenvalue of a graph}, Volume = 91, Year = 1991} @inproceedings{P73, Author = {M. Pinsker}, Booktitle = {Proc. 7th Intern. Teletraffic Conf.}, Pages = {318/1-318/4}, Title = {On the complexity of a concentrator}, Year = 1973} @article{R38, Author = {{G. de B.} Robinson}, Date-Modified = {2010-04-30 15:20:32 -0400}, Journal = AmerJMath, Note = {\url{http://www.jstor.org/stable/2371609}}, Number = {3}, Pages = {745--760}, Title = {On the Representations of the Symmetric Group}, Volume = {60}, Year = {1938}} @article{S61, Author = {C. Schensted}, Journal = CanadJMath, Number = 2, Pages = {179--191}, Title = {Longest increasing and decreasing subsequences}, Volume = 13, Year = 1961} @inproceedings{W06, Author = {John Watrous}, Booktitle = {Proc. 38th {STOC}}, Date-Modified = {2010-04-30 15:22:57 -0400}, Eprint = {stoc:10.1145/1132516.1132560}, Pages = {296--305}, Publisher = acm, Title = {Zero-knowledge against quantum attacks}, Year = 2006} @article{JM87, Author = {Shuji Jimbo and Akira Maruoka}, Date-Modified = {2010-04-30 15:11:46 -0400}, Eprint = {springer:6w2126413464n387}, Journal = Combinatorica, Number = 4, Pages = {343--355}, Title = {Expanders obtained from affine transformations}, Volume = 7, Year = 1987} @article{K84, Author = {Maria Klawe}, Date-Modified = {2010-04-29 15:27:50 -0400}, Eprint = {sicomp:10.1137/0213011}, Journal = SIAMJComput, Number = 1, Pages = {156--166}, Title = {Limitations on Explicit Constructions of Expanding Graphs}, Volume = 13, Year = 1984} @article{M88, Author = {G. A. Margulis}, Date-Modified = {2010-04-30 15:15:27 -0400}, Journal = ProblemyPeredachiInformatsii, Note = {\url{http://mi.mathnet.ru/eng/ppi686}}, Number = 1, Pages = {51--60}, Title = {Explicit group-theoretic constructions of combinatorial schemes and their applications in the construction of expanders and concentrators}, Volume = 24, Year = 1988} @article{PR97, Author = {Sandu Popescu and Daniel Rohrlich}, Date-Modified = {2010-04-30 15:19:08 -0400}, Eprint = {pra:10.1103/PhysRevA.56.R3319}, Journal = PhysRevA, Number = 5, Pages = {3319--3321}, Title = {Thermodynamics and the measure of entanglement}, Volume = 56, Year = 1997} @article{LR92, Author = {John D. Lafferty and Daniel Rockmore}, Date-Modified = {2010-04-29 15:29:00 -0400}, Journal = ExperimentMath, Note = {\url{http://www.expmath.org/restricted/1/1.2/lafferty.ps.gz}}, Number = 2, Pages = {115--139}, Title = {Fast {Fourier} analysis for {${\rm SL}\sb 2$} over a finite field and related numerical experiments}, Volume = 1, Year = 1992} @article{M95, Author = {M. Morgenstern}, Eprint = {springer:pg076647j3q32150}, Journal = Combinatorica, Number = {1}, Pages = {111--122}, Title = {Natural bounded concentrators}, Volume = {15}, Year = {1995}} @article{RVW00, Author = {Omer Reingold and Salil Vadhan and Avi Wigderson}, Date-Modified = {2010-04-30 15:25:23 -0400}, Journal = AnnofMath, Number = 1, Pages = {157--187}, Title = {Entropy waves, the zig-zag graph product, and new constant-degree expanders}, Volume = 155, Year = 2002} @article{Morgenstern94, Author = {Morgenstern, Moshe}, Date-Modified = {2010-04-30 15:16:04 -0400}, Eprint = {elsevier:10.1006/jctb.1994.1054}, Journal = JCombinTheorySerB, Number = 1, Pages = {44--62}, Title = {Existence and explicit constructions of {$q+1$} regular {Ramanujan} graphs for every prime power {$q$}}, Volume = 62, Year = 1994} @article{Friedman04, Author = {Friedman, Joel}, Date-Modified = {2010-04-30 15:10:29 -0400}, Journal = MemAmerMathSoc, Title = {A proof of {Alon's} second eigenvalue conjecture}, Year = {to appear}} @book{NC00, Author = {Michael A. Nielsen and Isaac L. Chuang}, Date-Modified = {2010-04-30 15:17:15 -0400}, Publisher = {Cambridge University Press}, Title = {Quantum Computation and Quantum Information}, Year = 2000} @inproceedings{W02, Author = {John Watrous}, Booktitle = {Proc. 43rd {FOCS}}, Date-Modified = {2010-04-30 15:23:05 -0400}, Eprint = {focs:10.1109/SFCS.2002.1181970}, Pages = {459--470}, Publisher = IEEE, Title = {Limits on the Power of Quantum Statistical Zero-Knowledge}, Year = 2002} @inproceedings{SV99, Author = {Amit Sahai and Salil Vadhan}, Booktitle = {Proc. Randomization Methods in Algorithm Design ({DIMACS} Workshop, December 1997)}, Date-Modified = {2010-04-30 15:21:49 -0400}, Pages = {251--270}, Publisher = ams, Series = {{DIMACS} Series in Discrete Mathematics and Theoretical Computer Science}, Title = {Manipulating Statistical Difference}, Volume = 43, Year = 1999} @article{GW97, Author = {Oded Goldreich and Avi Wigderson}, Date-Modified = {2010-04-30 15:26:18 -0400}, Eprint = {wiley:10.1002/(SICI)1098-2418(199712)11:4<315::AID-RSA3>3.0.CO;2-1}, Journal = RandomStructuresAlgorithms, Number = 4, Pages = {315--343}, Title = {Tiny families of functions with random properties: {A} quality-size trade-off for hashing}, Volume = 11, Year = 1997} @article{K05, Author = {Martin Kassabov}, Date-Modified = {2010-04-30 15:14:23 -0400}, Journal = ElectronResAnnouncAmerMathSoc, Title = {Symmetric groups and expanders}, Volume = 11, Year = 2005} @article{LPS88, Author = {A. Lubotzky and R. Philips and P. Sarnak}, Date-Modified = {2010-04-14 14:05:06 -0400}, Eprint = {springer:k285687344657q53}, Journal = Combinatorica, Number = 3, Pages = {261--277}, Title = {{Ramanujan} Graphs}, Volume = 8, Year = 1988} @book{Serre77, Author = {Jean-Pierre Serre}, Date-Modified = {2010-04-14 14:04:08 -0400}, Publisher = {Springer}, Series = {Graduate texts in Mathematics}, Title = {Linear representations of finite groups}, Volume = 42, Year = 1977} @book{FH91, Author = {Joe Harris and William Fulton}, Date-Modified = {2010-04-29 15:23:21 -0400}, Publisher = {Springer}, Title = {Representation Theory}, Year = 1991} @misc{Adams02, Author = {Jeffrey Adams}, Date-Modified = {2010-04-29 15:09:44 -0400}, Howpublished = {\\\url{http://www.math.umd.edu/~jda/characters/characters.pdf}}, Title = {Character Tables for {$GL(2),SL(2),PGL(2)$} and {$PSL(2)$} over a finite field}, Year = {2002}} @phdthesis{VadThesis, Author = {Vadhan, Salil}, Date-Modified = {2010-04-30 15:22:33 -0400}, School = {Massachusetts Institute of Technology}, Title = {A Study of Statistical Zero-Knowledge Proofs}, Year = 1999} %%%%%%%%%%%%%%%%%%%%%%%%%% %%%%% bib of v006a004 %%%%%%%%%%%%%%%%%%%%%%%%%% %% Theory of Computing %% File: v006a004.bib %% Publication date: August 17, 2010 %% Authors: Homin K. Lee @comment{The Annals of Statistics} @string{AnnStatist="Ann. Statist."} @comment{SIAM Journal on Computing} @string{SIAMJComput="SIAM J. Comput."} @INCOLLECTION{BenOrLinial-1985, author = {Michael Ben-Or and Nathan Linial}, title = {Collective Coin Flipping}, booktitle = {Randomness and Computation}, editor = {S. Micali}, year = {1989}, pages = {91--115}, publisher = {Acad. Press}, note = {Preliminary version in {\emph{Proc. FOCS'85}}}, } @ARTICLE{EfronStein-1981, author = {Bradley Efron and Charles Stein}, title = {The jackknife estimate of variance}, journal = AnnStatist, year = {1981}, volume = {9}, pages = {586--596}, http="http://projecteuclid.org/euclid.aos/1176345462", doi="10.1214/aos/1176345462" } @ARTICLE{ODonnellServedio-2006, author = {Ryan O'Donnell and Rocco A. Servedio}, title = {Learning Monotone Decision Trees in Polynomial Time}, journal = SIAMJComput, year = {2007}, volume = 37, number = 3, pages = {827--844}, note = {Preliminary version in {\emph{Proc. of CCC'06}}}, printoutnum = {389}, doi="10.1137/060669309", } @INPROCEEDINGS{OSSS-2005, author = {Ryan O'Donnell and Michael Saks and Oded Schramm and Rocco A. Servedio}, title = {Every decision tree has an influential variable}, booktitle = {Proc. 46th FOCS}, year = {2005}, pages = {31--39}, publisher = {IEEE Computer Soc.}, printoutnum = {356}, doi="10.1109/SFCS.2005.34" } @ARTICLE{Steele-1986, author = {J. Michael Steele}, title = {An {E}fron-{S}tein inequality for nonsymmetric statistics}, journal = AnnStatist, year = {1986}, volume = {14}, pages = {753--758}, http="http://projecteuclid.org/euclid.aos/1176349952", doi="10.1214/aos/1176349952" } %%%%%%%%%%%%%%%%%%%%%%%%%% %%%%% bib of v006a005 %%%%%%%%%%%%%%%%%%%%%%%%%% %% Theory of Computing %% File: v006a005.bib %% Publication date: August 25, 2010 %% Authors: Daniel Marx @comment{Journal of the ACM} @string{JACM="J. ACM"} @comment{Journal of Algorithms} @string{JAlgorithms="J. Algorithms"} @comment{ACM Transactions on Algorithms} @string{ACMTransAlgorithms="ACM Trans. Algorithms"} @comment{Acta Cybernetica} @string{ActaCybernet="Acta Cybernet."} @comment{Theoretical Computer Science} @string{TheoretComputSci="Theoret. Comput. Sci."} @comment{Lecture Notes in Computer Science} @string{LectureNotesinComputSci="Lecture Notes in Comput. Sci."} @comment{Monographs in Computer Science} @string{MonogrComputSci="Monogr. Comput. Sci."} @comment{SIAM Journal on Computing} @string{SIAMJComput="SIAM J. Comput."} @comment{Electronic Notes in Theoretical Computer Science} @string{ElectronNotesTheorComputSci="Electron. Notes Theor. Comput. Sci."} @comment{Journal of Computer and System Sciences} @string{JComputSystemSci="J. Comput. System Sci."} @comment{Bulletin of the European Association for Theoretical Computer Science. EATCS} @string{BullEurAssocTheorComputSciEATCS="Bull. Eur. Assoc. Theor. Comput. Sci. EATCS"} @comment{Texts in Theoretical Computer Science. An EATCS Series} @string{TextsTheoretComputSciEATCSSer="Texts Theoret. Comput. Sci. EATCS Ser."} @comment{Journal of Combinatorial Theory. Series B} @string{JCombinTheorySerB="J. Combin. Theory Ser. B"} @string{ieee="IEEE Comp. Soc. Press"} @string{acm="ACM Press"} @InCollection{ mr80d:68058, author = {Schaefer, Thomas J.}, title = {The complexity of satisfiability problems}, booktitle = {Proc. 10th STOC}, pages = {216--226}, publisher = acm, address = {New York}, year = {1978}, mrclass = {68C25 (03B05 03D15 05C15 68E10)}, mrnumber = {MR521057 (80d:68058)}, mrreviewer = {M. I. Dekhtyar}, doi="10.1145/800133.804350" } @Article{ mr95a:05023, author = {Bodlaender, Hans L.}, title = {A tourist guide through treewidth}, journal = ActaCybernet, fjournal = {Acta Cybernetica}, volume = {11}, year = {1993}, number = {1-2}, pages = {1--21}, issn = {0324-721X}, coden = {ACCYDX}, mrclass = {05C05 (68R10)}, mrnumber = {95a:05023}, mrreviewer = {Miros{\l}aw Truszczy{\'n}ski}, pdf="http://www.inf.u-szeged.hu/actacybernetica/edb/vol11n1_2/pdf/Bodlaender_1993_ActaCybernetica.pdf" } @Article{ mr99k:05146, author = {Bodlaender, Hans L.}, title = {A partial $k$-arboretum of graphs with bounded treewidth}, journal = TheoretComputSci, fjournal = {Theoretical Computer Science}, volume = {209}, year = {1998}, number = {1-2}, pages = {1--45}, issn = {0304-3975}, coden = {TCSDI}, mrclass = {05C85 (05C78 68R10)}, mrnumber = {99k:05146}, mrreviewer = {Gary MacGillivray}, doi="10.1016/S0304-3975(97)00228-4" } @Book{ mr96d:05038, author = {Kloks, Ton}, title = {Treewidth}, series = LectureNotesinComputSci, volume = {842}, publisher = {Springer}, address = {Berlin}, year = {1994}, pages = {x+209}, isbn = {3-540-58356-4}, mrclass = {05C05 (05C75 68-02 68Q20 68Q25 68R10)}, mrnumber = {96d:05038}, mrreviewer = {Miros{\l}aw Truszczy{\'n}ski} } @Book{ mr2001b:68042, author = {Downey, Rodney G. and Fellows, Michael R.}, title = {Parameterized Complexity}, series = MonogrComputSci, publisher = {Springer}, address = {New York}, year = {1999}, pages = {xvi+533}, isbn = {0-387-94883-X}, mrclass = {68Q15 (68-02 68R10)}, mrnumber = {2001b:68042}, mrreviewer = {William Gasarch} } @Article{ mr2000e:68063, author = {Feder, Tom{\'a}s and Vardi, Moshe Y.}, title = {The computational structure of monotone monadic {SNP} and constraint satisfaction: {A} study through {Datalog} and group theory}, journal = SIAMJComput, fjournal = {SIAM Journal on Computing}, volume = {28}, year = {1999}, number = {1}, pages = {57--104}, issn = {1095-7111}, mrclass = {68Q15 (03D15 68R05)}, mrnumber = {2000e:68063}, mrreviewer = {A. M. Dawes}, doi="10.1137/S0097539794266766" } @InProceedings{ downey03cutting, author = {Rodney G. Downey and Vladimir Estivill-Castro and Michael R. Fellows and Elena Prieto and Frances Rosamond}, title = {Cutting Up is Hard to Do}, booktitle = ElectronNotesTheorComputSci, volume = {78}, publisher = {Elsevier}, editor = {James Harland}, year = {2003}, ps="www.mcs.vuw.ac.nz/math/papers/cuttingup.ps" } @InProceedings{ tight-ccc2004, author = "Jianer Chen and Benny Chor and Mike Fellows and Xiuzhen Huang and David W. Juedes and Iyad A. Kanj and Ge Xia", title = "Tight Lower Bounds for Certain Parameterized {N}{P}-hard Problems", booktitle = {Proc. 19th Ann. IEEE Conf. Comput. Complexity}, year = {2004}, pages = {150--160}, location = {Amherst, Massachusetts, United States}, doi="10.1109/CCC.2004.1313826", publisher = ieee, } @InProceedings{ grohe-marx, author = {Martin Grohe and D\'aniel Marx}, title = {Constraint solving via fractional edge covers}, booktitle = {Proc. 17th Ann. ACM-SIAM Symp. Discrete Algorithms (SODA 2006)}, year = {2006}, isbn = {0-89871-605-5}, pages = {289--298}, location = {Miami, Florida}, doi = {10.1145/1109557.1109590}, publisher = acm, address = {New York, NY, USA}, } @Article{ mr1894519, author = {Impagliazzo, Russell and Paturi, Ramamohan and Zane, Francis}, title = {Which problems have strongly exponential complexity?}, journal = JComputSystemSci, fjournal = {Journal of Computer and System Sciences}, volume = {63}, year = {2001}, number = {4}, pages = {512--530}, issn = {0022-0000}, coden = {JCSSBM}, mrclass = {68Q15 (68Q17 68R10)}, mrnumber = {MR1894519 (2003d:68078)}, mrreviewer = {William Gasarch}, doi="10.1109/SFCS.1998.743516" } @InProceedings{ mr2121603, author = {Chen, Jianer and Huang, Xiuzhen and Kanj, Iyad A. and Xia, Ge}, title = {Linear {FPT} reductions and computational lower bounds}, booktitle = {Proc. 36th STOC}, pages = {212--221}, address = {New York}, year = {2004}, mrclass = {68Q17 (68Q15 68Q25 68W25)}, mrnumber = {MR2121603 (2005j:68040)}, doi="10.1145/1007352.1007391", publisher = acm, } @Book{ mr2159259, author = {Diestel, Reinhard}, title = {Graph theory}, series = {Graduate Texts in Mathematics}, volume = {173}, edition = {Third}, publisher = {Springer-Verlag}, address = {Berlin}, year = {2005}, pages = {xvi+411}, isbn = {978-3-540-26182-7; 3-540-26182-6; 978-3-540-26183-4}, mrclass = {05-06 (05Cxx)}, mrnumber = {MR2159259 (2006e:05001)}, mrreviewer = {Gabriel Semani{\v{s}}in} } @Article{ mr2132857, author = {Flum, J{\"o}rg and Grohe, Martin}, title = {Parameterized complexity and subexponential time}, journal = BullEurAssocTheorComputSciEATCS, fjournal = {Bulletin of the European Association for Theoretical Computer Science. EATCS}, number = {84}, year = {2004}, pages = {71--100}, issn = {0252-9742}, mrclass = {68Q15}, mrnumber = {MR2132857}, pdf="http://www.eatcs.org/images/bulletin/beatcs84.pdf" } @Article{ mr1411787, author = {Alon, Noga and Yuster, Raphael and Zwick, Uri}, title = {Color-coding}, journal = JACM, fjournal = {Journal of the Association for Computing Machinery}, volume = {42}, year = {1995}, number = {4}, pages = {844--856}, issn = {0004-5411}, coden = {JACOAH}, mrclass = {68Q25 (05C38 05C85 68R10)}, mrnumber = {MR1411787 (97i:68091)}, mrreviewer = {Hans L. Bodlaender}, doi="10.1145/210332.210337" } @comment {Bruce Reed}, @InCollection{ ree97, author = {B. A. Reed}, title = {Tree Width and Tangles: A New Connectivity Measure and some Applications}, booktitle = {Surveys in Combinatorics}, publisher = {Cambridge University Press}, series = {LMS Lecture Note Series}, volume = 241, year = {1997}, editor = {R.A.~Bailey}, pages = {87--162}, doi="10.1017/CBO9780511662119.006" } @Book{ mr2238686, author = {Flum, J{\"o}rg and Grohe, Martin}, title = {Parameterized Complexity Theory}, series = TextsTheoretComputSciEATCSSer, publisher = {Springer}, address = {Berlin}, year = {2006}, pages = {xiv+493}, isbn = {978-3-540-29952-3; 3-540-29952-1}, mrclass = {68-02 (03D05 03D15 68Q15 68Q25 68R10)}, mrnumber = {MR2238686} } @InProceedings{ freuder90aa, author = {Eugene C. Freuder}, title = {Complexity of $K$-Tree Structured Constraint Satisfaction Problems}, year = 1990, booktitle = {Proc. 8th National Conf. Artif. Intell. (AAAI)}, address = "Boston, MA", pages = {4--9}, keywords = {}, publisher = {AAAI Press} } @InProceedings{ 10.1109/lics.2003.1210072, author = {Andrei A. Bulatov}, title = {Tractable conservative Constraint Satisfaction Problems}, booktitle = {Proc. 18th Ann. IEEE Symp. Logic in Computer Science (LICS)}, year = {2003}, issn = {1043-6871}, pages = {321}, publisher = ieee, address = {Los Alamitos, CA, USA}, doi="10.1109/LICS.2003.1210072" } @comment {Andrei A. Bulatov and Andrei A. Krokhin and Peter Jeavons}, @InProceedings{ buljeakro01, author = {Andrei Bulatov and Andrei Krokhin and Peter Jeavons}, title = {The complexity of maximal constraint languages}, booktitle = {Proc. 33rd STOC}, pages = {667--674}, year = {2001}, doi="10.1145/380752.380868", publisher = acm, } @Article{ jeacohgys97, author = {Peter Jeavons and David A. Cohen and Marc Gyssens}, title = {Closure properties of constraints}, journal = JACM, year = {1997}, volume = {44}, number = {4}, pages = {527--548}, doi="10.1145/263867.263489" } @Article{ 1206036, author = {Martin Grohe}, title = {The complexity of homomorphism and constraint satisfaction problems seen from the other side}, journal = JACM, volume = {54}, number = {1}, year = {2007}, issn = {0004-5411}, pages = {1}, doi = {10.1145/1206035.1206036}, publisher = acm, address = {New York, NY, USA} } @InProceedings{ 380867, author = {Martin Grohe and Thomas Schwentick and Luc Segoufin}, title = {When is the evaluation of conjunctive queries tractable?}, booktitle = {Proc.33rd STOC}, year = {2001}, isbn = {1-58113-349-9}, pages = {657--666}, location = {Hersonissos, Greece}, doi = {10.1145/380752.380867}, publisher = acm, address = {New York, NY, USA} } @InProceedings{ dblp:conf/mfcs/grohe06, author = {Martin Grohe}, title = {The Structure of Tractable Constraint Satisfaction Problems.}, booktitle = {Proc. Mathematical Found. of Computer Science}, series = LectureNotesinComputSci, volume =4162, year = {2006}, pages = {58--72}, doi = {10.1007/11821069\_5}, bibsource = {DBLP, http://dblp.uni-trier.de}, publisher = {Springer}, } @InProceedings{ 727145, author = {{V\'\i ctor} Dalmau and Phokion G. Kolaitis and Moshe Y. Vardi}, title = {Constraint Satisfaction, Bounded Treewidth, and Finite-Variable Logics}, booktitle = {Proc. 8th Intern. Conf. Principles and Practice of Constraint Programming (CP)}, year = {2002}, isbn = {3-540-44120-4}, pages = {310--326}, publisher = {Springer-Verlag}, address = {London, UK}, doi="10.1007/3-540-46135-3\_21" } @Article{ 331526, author = {Tom Leighton and Satish Rao}, title = {Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms}, journal = JACM, volume = {46}, number = {6}, year = {1999}, issn = {0004-5411}, pages = {787--832}, doi = {10.1145/331524.331526}, publisher = {ACM Press}, address = {New York, NY, USA} } @Article{ mr854606, author = {Robertson, Neil and Seymour, P. D.}, title = {Graph minors. {V}. {E}xcluding a planar graph}, journal = JCombinTheorySerB, fjournal = {Journal of Combinatorial Theory. Series B}, volume = {41}, year = {1986}, number = {1}, pages = {92--114}, issn = {0095-8956}, coden = {JCBTB8}, mrclass = {05C38 (68R10)}, mrnumber = {MR854606 (89m:05070)}, doi="10.1016/0095-8956(86)90030-4" } @comment title = { Constraint satisfaction *problems* with succinctly @Article{ chen-grohe-succinct, author = {Hubie Chen and Martin Grohe}, title = { Constraint satisfaction with succinctly specified relations}, year = {2010}, volume = {76}, number = {8}, journal = JComputSystemSci, pages = {847--860}, doi = {10.1016/j.jcss.2010.04.003} } @InCollection{ mr2213853, author = {Gottlob, Georg and Grohe, Martin and Musliu, Nysret and Samer, Marko and Scarcello, Francesco}, title = {Hypertree decompositions: {Structure}, algorithms, and applications}, booktitle = {Graph-Theoretic Concepts in Computer Science}, series = LectureNotesinComputSci, volume = {3787}, pages = {1--15}, publisher = {Springer}, address = {Berlin}, year = {2005}, mrclass = {68R10 (05C65 05C85 68Q25)}, mrnumber = {MR2213853}, doi="10.1007/11604686\_1" } @Article{ grohe-marx-brambles, title = {On tree width, bramble size, and expansion}, author = {Martin Grohe and D\'aniel Marx}, year = {2009}, journal = JCombinTheorySerB, volume = 99, number = 1, pages = {218--228}, doi="10.1016/j.jctb.2008.06.004" } @Article{ mr2212000, author = {Bulatov, Andrei A.}, title = {A dichotomy theorem for constraint satisfaction problems on a 3-element set}, journal = JACM, fjournal = {Journal of the ACM}, volume = {53}, year = {2006}, number = {1}, pages = {66--120}, issn = {0004-5411}, mrclass = {68Q25 (68T20)}, mrnumber = {MR2212000 (2006m:68045)}, mrreviewer = {Benoit Larose}, doi="10.1145/1120582.1120584" } @Article{ marx-closest-full, author = "D\'aniel Marx", title = "Closest substring problems with small distances", journal = SIAMJComput, volume = 38, number = 4, pages = "1382--1410", year = "2008", doi="10.1137/060673898" } @Article{ dblp:journals/cj/gottlobs08, author = {Georg Gottlob and Stefan Szeider}, title = {Fixed-Parameter Algorithms For Artificial Intelligence, Constraint Satisfaction and Database Problems}, journal = {Comput. J.}, fjournal = {The Computer Journal}, volume = {51}, number = {3}, year = {2008}, pages = {303--325}, doi= {10.1093/comjnl/bxm056}, bibsource = {DBLP, http://dblp.uni-trier.de} } @article{DBLP:journals/talg/Marx10, author = {D{\'a}niel Marx}, title = {Approximating fractional hypertree width}, journal = ACMTransAlgorithms, volume = {6}, number = {2}, year = {2010}, doi = {10.1145/1721837.1721845}, bibsource = {DBLP, http://dblp.uni-trier.de} } @InProceedings{ marx-stacs-ttcsp, author = {D{\'a}niel Marx}, title = {Tractable Structures for Constraint Satisfaction with Truth Tables}, pages = {649--660}, booktitle = {Proc. 26th Intern. Symp. Theoretical Aspects of Computer Science (STACS)}, year = {2009}, editor = {Susanne Albers and Jean-Yves Marion}, publisher = {Schlo{\ss} Dagstuhl - Leibniz-Zentrum {f\"ur} Informatik, Germany}, url = {http://drops.dagstuhl.de/opus/volltexte/2009/1807}, doi="10.4230/LIPIcs.STACS.2009.1807" } @InProceedings{ dblp:conf/dagstuhl/scarcellogg08, author = {Francesco Scarcello and Georg Gottlob and Gianluigi Greco}, title = {Uniform Constraint Satisfaction Problems and Database Theory}, booktitle = {Complexity of Constraints}, year = {2008}, pages = {156--195}, doi = {10.1007/978-3-540-92800-3\_7}, bibsource = {DBLP, http://dblp.uni-trier.de} } @Article{ dblp:journals/tcs/fellowshrv09, author = {Michael R. Fellows and Danny Hermelin and Frances A. Rosamond and St{\'e}phane Vialette}, title = {On the parameterized complexity of multiple-interval graph problems}, journal = TheoretComputSci, volume = {410}, number = {1}, year = {2009}, pages = {53--61}, doi = {10.1016/j.tcs.2008.09.065}, bibsource = {DBLP, http://dblp.uni-trier.de} } @inproceedings{marx-stoc2010-csp, author = {D{\'a}niel Marx}, title = {Tractable hypergraph properties for constraint satisfaction and conjunctive queries}, booktitle ="Proc. 42nd STOC", year="2010", pages="735--744", location="Cambridge, Massachusetts", doi="10.1145/1806689.1806790", publisher = acm } @Article{ mr633542, author = {Gabber, Ofer and Galil, Zvi}, title = {Explicit constructions of linear-sized superconcentrators}, note = {Special issued dedicated to Michael Machtey}, journal = JComputSystemSci, fjournal = {Journal of Computer and System Sciences}, volume = {22}, year = {1981}, number = {3}, pages = {407--420}, issn = {0022-0000}, coden = {JCSSBM}, mrclass = {94C15 (05C20)}, mrnumber = {MR633542 (83d:94029)}, mrreviewer = {Takao Ozawa}, doi = {10.1016/0022-0000(81)90040-4}, } @Misc{ alon-marx-sparse, author = {Noga Alon and D\'aniel Marx}, title={Sparse balanced partitions and the complexity of subgraph problems}, howpublished = {Manuscript}, year = {2010} } @InProceedings{ fomin-cliquewidth-soda2010, author = {Fedor Fomin and Petr Golovach and Daniel Lokshtanov and Saket Saurabh}, title = {Algorithmic Lower Bounds for Problems Parameterized by Clique-width}, booktitle = {Proc. 21st Ann. ACM-SIAM Symp. Discrete Algorithms (SODA 2010)}, year = {2006}, publisher = acm, pages = {493--502}, } @Article{ dblp:journals/siamcomp/feigehl08, author = {Uriel Feige and MohammadTaghi Hajiaghayi and James R. Lee}, title = {Improved Approximation Algorithms for Minimum Weight Vertex Separators}, journal = SIAMJComput, volume = {38}, number = {2}, year = {2008}, pages = {629--657}, doi = {10.1137/05064299X}, bibsource = {DBLP, http://dblp.uni-trier.de} } @article {MR88c:05053, AUTHOR = {Robertson, Neil and Seymour, P. D.}, TITLE = {Graph minors. {II}. {A}lgorithmic aspects of tree-width}, JOURNAL = JAlgorithms, FJOURNAL = {Journal of Algorithms}, VOLUME = {7}, YEAR = {1986}, NUMBER = {3}, PAGES = {309--322}, ISSN = {0196-6774}, CODEN = {JOALDV}, MRCLASS = {05C05 (05C38)}, MRNUMBER = {88c:05053}, MRREVIEWER = {Paolo Toth}, doi="10.1016/0196-6774(86)90023-4" } %%%%%%%%%%%%%%%%%%%%%%%%%% %%%%% bib of v006a006 %%%%%%%%%%%%%%%%%%%%%%%%%% %% Theory of Computing %% File: v006a006.bib %% Publication date: September 2, 2010 %% Authors: Navin Goyal and Michael Saks @comment{Journal of Computer and System Sciences} @string{JComputSystemSci="J. Comput. System Sci."} @comment{SIAM Journal on Computing} @string{SIAMJComput="SIAM J. Comput."} @comment{SIAM Journal on Discrete Mathematics} @string{SIAMJDiscreteMath="SIAM J. Discrete Math."} @comment{Journal of Algorithms} @string{JAlgorithms="J. Algorithms"} @comment{Information Processing Letters} @string{InformProcessLett="Inform. Process. Lett."} @comment{Series on Applied Mathematics} @string{SerApplMath="Ser. Appl. Math."} @string{ieee="IEEE Comp. Soc. Press"} @string{acm="ACM Press"} @comment William L. Steiger @article{AKSS, author = {Mikl{\'o}s Ajtai and J{\'a}nos Koml{\'o}s and W. L. Steiger and Endre Szemer{\'e}di}, title = {Optimal Parallel Selection has Complexity {O}($\log \log n$)}, journal = JComputSystemSci, volume = {38}, number = {1}, year = {1989}, pages = {125--133}, bibsource = {DBLP, http://dblp.uni-trier.de}, doi="10.1016/0022-0000(89)90035-4" } @comment William S. Evans @article{EvPi, author = {William Evans and Nicholas Pippenger}, title = {Average-Case Lower Bounds for Noisy {Boolean} Decision Trees}, journal = SIAMJComput, volume = {28}, number = {2}, year = {1998}, pages = {433--446}, bibsource = {DBLP, http://dblp.uni-trier.de}, doi="10.1137/S0097539796310102" } @article{Fe, author = {Uriel Feige}, title = {On the Complexity of Finite Random Functions}, journal = InformProcessLett, volume = {44}, number = {6}, year = {1992}, pages = {295--296}, doi="10.1016/0020-0190(92)90102-2" } @article{FeKi, author = {Uriel Feige and Joe Kilian}, title = {Finding {OR} in a noisy broadcast network}, journal = InformProcessLett, volume = {73}, number = {1-2}, year = {2000}, pages = {69--75}, doi="10.1016/S0020-0190(00)00002-8" } @article{FRPU, author = {Uriel Feige and Prabhakar Raghavan and David Peleg and Eli Upfal}, title = {Computing with Noisy Information}, journal = SIAMJComput, volume = {23}, number = {5}, year = {1994}, pages = {1001--1018}, bibsource = {DBLP, http://dblp.uni-trier.de}, doi="10.1137/S0097539791195877" } @article{KuMa, author = {Eyal Kushilevitz and Yishay Mansour}, title = {Computation in Noisy Radio Networks}, journal = SIAMJDiscreteMath, volume = {19}, number = {1}, year = {2005}, pages = {96--108}, ee = {http://dx.doi.org/10.1137/S0895480103434063}, bibsource = {DBLP, http://dblp.uni-trier.de}, doi="10.1137/S0895480103434063" } @incollection{vonN, author = {John von Neumann}, title = {Various techniques used in connection with random digits}, booktitle = {Monte Carlo Method}, editor = {A. S. Householder and G. E. Forsythe and H. H. Germond}, series = {National Bureau of Standards Applied Mathematics Series}, volume = {12}, year = {1951}, pages = {36--38}, bibsource = {DBLP, http://dblp.uni-trier.de} } @inproceedings{Ne, author = {Ilan Newman}, title = {Computing in Fault Tolerance Broadcast Networks}, booktitle = {Proc. IEEE Conf. on Comput. Complex.}, year = {2004}, pages = {113--122}, doi="10.1109/CCC.2004.1313813", publisher=ieee } @article{Rei, author = {R{\"u}diger Reischuk}, title = {Probabilistic Parallel Algorithms for Sorting and Selection}, journal = SIAMJComput, volume = {14}, number = {2}, year = {1985}, pages = {396--409}, bibsource = {DBLP, http://dblp.uni-trier.de}, doi="10.1137/0214030" } @inproceedings{RS, author = {R{\"u}diger Reischuk and Bernd Schmeltz}, title = {Reliable Computation with Noisy Circuits and Decision Trees---{A} General $n \log n$ Lower Bound}, booktitle = {Proc. 32nd FOCS}, publisher=ieee, doi="10.1109/SFCS.1991.185425", year = {1991}, pages = {602--611}, } @article{ShVi, author = {Yossi Shiloach and Uzi Vishkin}, title = {Finding the Maximum, Merging, and Sorting in a Parallel Computation Model}, journal = JAlgorithms, volume = {2}, number = {1}, year = {1981}, pages = {88--102}, bibsource = {DBLP, http://dblp.uni-trier.de} } @article{Val, author = {Leslie G. Valiant}, title = {Parallelism in Comparison Problems}, journal = SIAMJComput, volume = {4}, number = {3}, year = {1975}, pages = {348--355}, bibsource = {DBLP, http://dblp.uni-trier.de}, doi="10.1137/0204030" } @inproceedings{Yao, author = {Andrew Chi-Chih Yao}, title = {Probabilistic Computations: Toward a Unified Measure of Complexity}, booktitle = {Proc. 18th FOCS}, publisher=ieee, doi="10.1109/SFCS.1977.24", year = {1977}, pages = {222--227}, } %%%%%%%%%%%%%%%%%%%%%%%%%% %%%%% bib of v006a007 %%%%%%%%%%%%%%%%%%%%%%%%%% %% This BibTeX bibliography file was created using BibDesk. %% http://bibdesk.sourceforge.net/ %% Created for Alexander Russell at 2010-09-09 12:21:11 -0400 %% Saved with string encoding Unicode (UTF-8) @preamble{{\providecommand{\noopsort}[1]{}}} @comment{Annals of Pure and Applied Logic} @comment{Proceedings of the Steklov Institute of Mathematics} @comment{Journal of Symbolic Computation} @comment{Applicable Algebra in Engineering, Communication and Computing} @comment{Combinatorica. An International Journal on Combinatorics and the Theory of Computing} @comment{Information Processing Letters} @comment{Journal of the ACM} @comment{Theory of Computing. An Open Access Journal} @comment{Rossiiskaya Akademiya Nauk. Matematicheskie Zametki} @comment{Progress in Computer Science and Applied Logic} @comment{SIAM Journal on Computing} @comment{Computational Complexity} @comment{Theoretical Computer Science} @comment{Journal of Computer and System Sciences} @comment{Advances in Computing Research} @comment{Theory of Computing Systems} @string{advcres = {Adv. Comput. Res.}} @string{annpureappllogic = {Ann. Pure Appl. Logic}} @string{applalgebraengrgcommcomput = {Appl. Algebra Engrg. Comm. Comput.}} @string{combinatorica = {Combinatorica}} @string{compcomplex = {Comput. Complexity}} @string{informprocesslett = {Inform. Process. Lett.}} @string{jacm = {J. ACM}} @string{jcomputsystemsci = {J. Comput. System Sci.}} @string{jsymboliccomput = {J. Symbolic Comput.}} @string{matzametki = {Mat. Zametki}} @string{procsteklovinstmath = {Proc. Steklov Inst. Math.}} @string{progrcomputsciappllogic = {Progr. Comput. Sci. Appl. Logic}} @string{siamjcomput = {SIAM J. Comput.}} @string{theoretcomputsci = {Theoret. Comput. Sci.}} @string{theorycomput = {Theory Comput.}} @string{theorycomputsyst = {Theory Comput. Syst.}} @inproceedings{AV, Author = {Manindra Agrawal and V. Vinay}, Booktitle = {Proc. 49th FOCS}, Doi = {10.1109/FOCS.2008.32}, Pages = {67--75}, Publisher = {IEEE Comp. Soc.}, Title = {Arithmetic Circuits: A Chasm at Depth Four}, Year = 2008, Bdsk-Url-1 = {http://dx.doi.org/10.1109/FOCS.2008.32}} @article{Ajt, Author = {M. Ajtai}, Doi = {10.1016/0168-0072(83)90038-6}, Journal = AnnPureApplLogic, Pages = {1--48}, Title = {{$\Sigma_1^1$}-Formulae on Finite Structures}, Volume = 24, Year = 1983, Bdsk-Url-1 = {http://dx.doi.org/10.1016/0168-0072(83)90038-6}} @article{ABRW, Author = {Michael Alekhnovich and Eli Ben-Sasson and Alexander A. Razborov and Avi Wigderson}, Doi = {10.1137/S0097539701389944}, Journal = SIAMJComput, Note = {A preliminary version appeared in FOCS 2000.}, Number = 1, Pages = {67--88}, Title = {Pseudorandom Generators in Propositional Proof Complexity}, Volume = {34}, Year = 2004, Bdsk-Url-1 = {http://dx.doi.org/10.1137/S0097539701389944}} @article{AR, Author = {Michael Alekhnovich and Alexander A. Razborov}, Doi = {10.1109/SFCS.2001.959893}, Journal = ProcSteklovInstMath, Note = {A preliminary version appeared in FOCS 2001.}, Pages = {18--35}, Title = {Lower Bounds for the Polynomial Calculus: Non-Binomial Case}, Volume = 242, Year = 2003, Bdsk-Url-1 = {http://dx.doi.org/10.1109/SFCS.2001.959893}} @book{Bur, Address = {Berlin}, Author = {Peter B{\"u}rgisser}, Publisher = {Springer}, Title = {Completeness and Reduction in Algebraic Complexity Theory}, Year = 2000} @book{BCS, Address = {Berlin}, Author = {Peter B{\"u}rgisser and Michel Clausen and Mohammad A. Shokrollahi}, Publisher = {Springer}, Title = {Algebraic Complexity Theory}, Year = 1997} @article{BS, Author = {Walter Baur and Volker Strassen}, Doi = {10.1016/0304-3975(83)90110-X}, Journal = TheoretComputSci, Number = 3, Pages = {317--330}, Title = {The Complexity of Partial Derivatives}, Volume = 22, Year = 1983, Bdsk-Url-1 = {http://dx.doi.org/10.1016/0304-3975(83)90110-X}} @inproceedings{DDPW, Author = {Danny Dolev and Cynthia Dwork and Nicholas Pippenger and Avi Wigderson}, Booktitle = {Proc. 15th STOC}, Doi = {10.1145/800061.808731}, Pages = {42--51}, Publisher = {ACM}, Title = {Superconcentrators, Generalizers and Generalized Connectors with Limited Depth}, Year = 1983, Bdsk-Url-1 = {http://dx.doi.org/10.1145/800061.808731}} @article{FSS, Author = {Merrick L. Furst and James B. Saxe and Michael Sipser}, Doi = {10.1007/BF01744431}, Journal = TheoryComputSyst, Note = {A preliminary version appeared in FOCS 1981.}, Number = 1, Pages = {13--27}, Title = {Parity, Circuits, and the Polynomial-Time Hierarchy}, Volume = {17}, Year = 1984, Bdsk-Url-1 = {http://dx.doi.org/10.1007/BF01744431}} @article{Gat1, Author = {Gathen, Joachim von zur}, Doi = {10.1016/S0747-7171(87)80063-9}, Journal = JSymbolicComput, Number = 2, Pages = {137--172}, Title = {Feasible Arithmetic Computations: Valiant's Hypothesis}, Volume = {4}, Year = 1987, Bdsk-Url-1 = {http://dx.doi.org/10.1016/S0747-7171(87)80063-9}} @article{Gat2, Author = {Gathen, Joachim von zur}, Doi = {10.1146/annurev.cs.03.060188.001533}, Journal = {Ann. Rev. Comput. Sci.}, Pages = {317--347}, Title = {Algebraic Complexity Theory}, Volume = 3, Year = 1988, Bdsk-Url-1 = {http://dx.doi.org/10.1146/annurev.cs.03.060188.001533}} @inproceedings{GK, Author = {Grigoriev, Dima and Karpinski, Marek}, Booktitle = {Proc. 30th STOC}, Doi = {10.1145/276698.276872}, Pages = {577--582}, Title = {An Exponential Lower Bound for Depth 3 Arithmetic Circuits}, Year = 1998, Bdsk-Url-1 = {http://dx.doi.org/10.1145/276698.276872}} @article{GR, Author = {D\noopsort{j}. Grigoriev and A. Razborov}, Doi = {10.1007/s002009900021}, Journal = ApplAlgebraEngrgCommComput, Note = {A preliminary version appeared in FOCS 1998.}, Number = 6, Pages = {465--487}, Title = {Exponential Lower Bounds for Depth 3 Arithmetic Circuits in Algebras of Functions over Finite Fields}, Volume = {10}, Year = 2000, Bdsk-Url-1 = {http://dx.doi.org/10.1007/s002009900021}} @article{Has, Author = {J. H{\aa}stad}, Doi = {10.1145/12130.12132}, Journal = AdvCRes, Note = {A preliminary version appeared in STOC 1986.}, Pages = {143--170}, Title = {Almost Optimal Lower Bounds for Small Depth Circuits}, Volume = 5, Year = 1989, Bdsk-Url-1 = {http://dx.doi.org/10.1145/12130.12132}} @article{IK, Author = {Valentine Kabanets and Russell Impagliazzo}, Doi = {10.1007/s00037-004-0182-6}, Journal = CompComplex, Note = {A preliminary version appeared in STOC 2003.}, Number = {1--2}, Pages = {1--46}, Title = {Derandomizing Polynomial Identity Tests Means Proving Circuit Lower Bounds}, Volume = {13}, Year = 2004, Bdsk-Url-1 = {http://dx.doi.org/10.1007/s00037-004-0182-6}} @article{Lip, Author = {Richard J. Lipton}, Doi = {10.1137/0207004}, Journal = SIAMJComput, Note = {A preliminary version appeared in FOCS 1975.}, Number = 1, Pages = {61--69}, Title = {Polynomials with 0-1 Coefficients that Are Hard to Evaluate}, Volume = {7}, Year = 1978, Bdsk-Url-1 = {http://dx.doi.org/10.1137/0207004}} @article{lok, Author = {Satyanarayana V. Lokam}, Doi = {10.1006/jcss.2001.1786}, Issue = 3, Journal = JComputSystemSci, Note = {A preliminary version appeared in FOCS 1995.}, Pages = {449--473}, Title = {Spectral Methods for Matrix Rigidity with Applications to Size-Depth Tradeoffs and Communication Complexity}, Volume = 63, Year = 2001, Bdsk-Url-1 = {http://dx.doi.org/10.1006/jcss.2001.1786}} @article{Mor, Author = {Jacques Morgenstern}, Date-Modified = {2010-09-09 12:15:17 -0400}, Doi = {10.1145/382242.382836}, Issue = 4, Journal = {ACM SIGACT News}, Pages = {60--62}, Title = {How to Compute Fast a Function and all its Derivatives: {A} Variation on the Theorem of {B}aur-{S}trassen}, Volume = 16, Year = 1985, Bdsk-Url-1 = {http://dx.doi.org/10.1145/382242.382836}} @inproceedings{Nis, Author = {Noam Nisan}, Booktitle = {Proc. 13th STOC}, Doi = {10.1145/103418.103462}, Pages = {410--418}, Publisher = {ACM}, Title = {Lower Bounds for Non-Commutative Computation}, Year = 1991, Bdsk-Url-1 = {http://dx.doi.org/10.1145/103418.103462}} @inproceedings{NW2, Author = {Noam Nisan and Avi Wigderson}, Booktitle = {Proc. 27th STOC}, Doi = {10.1145/225058.225290}, Pages = {723--732}, Publisher = {ACM}, Title = {On the Complexity of Bilinear Forms}, Year = 1995, Bdsk-Url-1 = {http://dx.doi.org/10.1145/225058.225290}} @article{P, Author = {P. Pudl{\'a}k}, Doi = {10.1007/BF01215351}, Issue = 2, Journal = Combinatorica, Pages = {203--216}, Title = {Communication in Bounded Depth Circuits}, Volume = {14}, Year = 1994, Bdsk-Url-1 = {http://dx.doi.org/10.1007/BF01215351}} @article{P2, Author = {Pavel Pudl{\'a}k}, Doi = {10.1016/S0020-0190(00)00058-2}, Issue = {5--6}, Journal = InformProcessLett, Pages = {197--201}, Title = {A Note on the Use of Determinant for Proving Lower Bounds on the Size of Linear Circuits}, Volume = {74}, Year = 2000, Bdsk-Url-1 = {http://dx.doi.org/10.1016/S0020-0190(00)00058-2}} @article{R, Author = {Ran Raz}, Doi = {10.1137/S0097539702402147}, Journal = SIAMJComput, Note = {A preliminary version appeared in STOC 2002.}, Number = 5, Pages = {1356--1369}, Title = {On the Complexity of Matrix Product}, Volume = {32}, Year = 2003, Bdsk-Url-1 = {http://dx.doi.org/10.1137/S0097539702402147}} @article{R2, Author = {Ran Raz}, Doi = {10.4086/toc.2006.v002a006}, Journal = TheoryComput, Note = {A preliminary version appeared in FOCS 2004 with the title ``Multilinear-$NC_1$ $\neq$ Multilinear-$NC_2$''}, Number = 6, Pages = {121--135}, Title = {Separation of Multilinear Circuit and Formula Size}, Volume = {2}, Year = 2006, Bdsk-Url-1 = {http://dx.doi.org/10.4086/toc.2006.v002a006}} @article{R1, Author = {Ran Raz}, Doi = {10.1145/1502793.1502797}, Issue = 2, Journal = JACM, Note = {A preliminary version appeared in STOC 2004.}, Title = {Multi-Linear Formulas for Permanent and Determinant are of Super-Polynomial Size}, Volume = 56, Year = 2009, Bdsk-Url-1 = {http://dx.doi.org/10.1145/1502793.1502797}} @inproceedings{R10, Author = {Ran Raz}, Booktitle = {Proc. 42nd STOC}, Doi = {10.1145/1806689.1806780}, Pages = {659--666}, Publisher = {ACM}, Title = {Tensor-Rank and Lower Bounds for Arithmetic Formulas}, Year = 2010, Bdsk-Url-1 = {http://dx.doi.org/10.1145/1806689.1806780}} @article{RS, Author = {Ran Raz and Amir Shpilka}, Doi = {10.1137/S009753970138462X}, Journal = SIAMJComput, Note = {A preliminary version appeared in STOC 2001.}, Number = 2, Pages = {488--513}, Title = {Lower Bounds for Matrix Product in Bounded Depth Circuits with Arbitrary Gates}, Volume = {32}, Year = 2003, Bdsk-Url-1 = {http://dx.doi.org/10.1137/S009753970138462X}} @article{RY07, Author = {Ran Raz and Amir Yehudayoff}, Doi = {10.1016/j.jcss.2010.06.013}, Journal = JComputSystemSci, Note = {A preliminary version appeared in FOCS 2008.}, Title = {Multilinear Formulas, Maximal-Partition Discrepancy and Mixed-Sources Extractors}, Year = 2010, Bdsk-Url-1 = {http://dx.doi.org/10.1016/j.jcss.2010.06.013}} @article{Razb1, Author = {A. A. Razborov}, Journal = MatZametki, Note = {An English translation appeared in Mathematical Notes of the Academy of Sci. of the USSR 41(4) (1987) 333--338}, Number = 4, Pages = {598--607}, Pdf = {http://people.cs.uchicago.edu/~razborov/files/depth.pdf}, Title = {Lower Bounds on the Size of Bounded-Depth Networks over a Complete Basis with Logical Addition (in {R}ussian)}, Volume = {41}, Year = 1987} @incollection{Razb2, Author = {A. A. Razborov}, Booktitle = {Feasible Mathematics II}, Date-Modified = {2010-09-09 12:16:16 -0400}, Editors = {P. Clote and J. Remmel}, Pages = {344--386}, Ps = {http://people.cs.uchicago.edu/~razborov/files/bobo.ps}, Publisher = {Birkh{\"a}user}, Series = ProgrComputSciApplLogic, Title = {Bounded Arithmetic and Lower Bounds in {Boolean} Complexity}, Volume = 13, Year = 1995} @inproceedings{SS, Author = {Victor Shoup and Roman Smolensky}, Booktitle = {Proc. 32nd FOCS}, Doi = {10.1109/SFCS.1991.185394}, Pages = {378--383}, Publisher = {IEEE Comp. Soc.}, Title = {Lower Bounds for Polynomial Evaluation and Interpolation Problems}, Year = 1991, Bdsk-Url-1 = {http://dx.doi.org/10.1109/SFCS.1991.185394}} @article{SW, Author = {A. Shpilka and A. Wigderson}, Doi = {10.1007/PL00001609}, Journal = CompComplex, Note = {A preliminary version appeared in Conference on Computational Complexity 1999.}, Number = 1, Pages = {1--27}, Title = {Depth-3 Arithmetic Circuits Over Fields of Characteristic Zero}, Volume = {10}, Year = 2001, Bdsk-Url-1 = {http://dx.doi.org/10.1007/PL00001609}} @inproceedings{Smo, Author = {R. Smolensky}, Booktitle = {Proc. 19th STOC}, Date-Modified = {2010-09-09 12:16:39 -0400}, Doi = {10.1145/28395.28404}, Pages = {77--82}, Publisher = {ACM}, Title = {Algebraic Methods in the Theory of Lower Bounds for {Boolean} Circuit Complexity}, Year = 1987, Bdsk-Url-1 = {http://dx.doi.org/10.1145/28395.28404}} @article{Str74, Author = {Volker Strassen}, Doi = {10.1137/0203010}, Journal = SIAMJComput, Number = 2, Pages = {128--149}, Title = {Polynomials with Rational Coefficients Which Are Hard to Compute}, Volume = {3}, Year = 1974, Bdsk-Url-1 = {http://dx.doi.org/10.1137/0203010}} @article{Str, Author = {Volker Strassen}, Date-Modified = {2010-09-09 12:17:27 -0400}, Doi = {10.1016/0304-3975(75)90010-9}, Journal = TheoretComputSci, Number = 1, Pages = {21--25}, Title = {Die {B}erechnungskomplexit{\"a}t der Symbolischen {D}ifferentiation von {I}nterpolationspolynomen}, Volume = {1}, Year = 1975, Bdsk-Url-1 = {http://dx.doi.org/10.1016/0304-3975(75)90010-9}} @inproceedings{Val, Author = {L. G. Valiant}, Booktitle = {Proc. 11th STOC}, Doi = {10.1145/800135.804419}, Pages = {249--261}, Title = {Completeness Classes in Algebra}, Year = 1979, Bdsk-Url-1 = {http://dx.doi.org/10.1145/800135.804419}} @article{VSBR, Author = {L. G. Valiant and S. Skyum and S. Berkowitz and C. Rackoff}, Doi = {10.1137/0212043}, Journal = SIAMJComput, Number = 4, Pages = {641--644}, Title = {Fast Parallel Computation of Polynomials Using Few Processors}, Volume = {12}, Year = 1983, Bdsk-Url-1 = {http://dx.doi.org/10.1137/0212043}} @inproceedings{Yao, Author = {Andrew Chi-Chih Yao}, Booktitle = {Proc. 26th FOCS}, Doi = {10.1109/SFCS.1985.49}, Pages = {1--10}, Publisher = {IEEE Comp. Soc.}, Title = {Separating the Polynomial-Time Hierarchy by Oracles}, Year = 1985, Bdsk-Url-1 = {http://dx.doi.org/10.1109/SFCS.1985.49}} %%%%%%%%%%%%%%%%%%%%%%%%%% %%%%% bib of v006a008 %%%%%%%%%%%%%%%%%%%%%%%%%% %% Theory of Computing %% File: v006a010.bib %% Publication date: September 18, 2010 %% Authors: Avrim Blum, Eyal Even-Dar, and Katrina Ligett %% Theory of Computing %% File: v006a010.bib %% Publication date: September 18, 2010 %% Authors: Avrim Blum, Eyal Even-Dar, and Katrina Ligett @comment{Journal of Machine Learning Research (JMLR)} @string{JMachLearnRes="J. Mach. Learn. Res."} @comment{Journal of Statistical Physics} @string{JStatPhys="J. Stat. Phys."} @comment{Journal of Economic Theory} @string{JEconomTheory="J. Econom. Theory"} @comment{International Journal of Game Theory} @string{InternatJGameTheory="Internat. J. Game Theory"} @comment{Mathematics of Operations Research} @string{MathOperRes="Math. Oper. Res."} @comment{Information and Computation} @string{InformandComput="Inform. and Comput."} @comment{SIAM Journal on Computing} @string{SIAMJComput="SIAM J. Comput."} @comment{Journal of the ACM} @string{JACM="J. ACM"} @comment{Games and Economic Behavior} @string{GamesEconomBehav="Games Econom. Behav."} @comment{Journal of Computer and System Sciences} @string{JComputSystemSci="J. Comput. System Sci."} @comment{Computer Science Review} @string{CompSciRev="Comput. Sci. Rev."} @comment{Econometrica. Journal of the Econometric Society} @string{Econometrica="Econometrica"} @comment{ACM Transactions on Algorithms} @string{ACMTransAlgorithms="ACM Trans. Algorithms"} @string{acm="ACM Press"} @conference{AHR08, title={{Competing in the dark: An efficient algorithm for bandit linear optimization}}, author={Abernethy, Jacob and Hazan, Elad and Rakhlin, Alexander}, booktitle={Proc. 21st Ann. Conf. Learning Theory (COLT)}, publisher={Springer}, year={2008}, note={\href{http://colt2008.cs.helsinki.fi/papers/123-Abernethy.pdf}{http://colt2008.cs.helsinki.fi/papers/123-Abernethy.pdf}}, } @INPROCEEDINGS(AK04, AUTHOR="Baruch Awerbuch and Robert D. Kleinberg", TITLE="Adaptive Routing With End-to-End Feedback: {D}istributed Learning and Geometric Approaches", BOOKTITLE="Proc.~36th STOC", PUBLISHER=acm, YEAR=2004, PAGES="45--53", doi="10.1145/1007352.1007367" ) @inbook{AZ98, chapter={{``On-line load balancing''}}, author={Azar, Yossi}, title={Online Algorithms: The State of the Art}, pages={178--195}, year={1998}, publisher={Springer} } @article{BG+06, title={{Distributed selfish load balancing.}}, author={Berenbrink, Petra and Friedetzky, Tom and Goldberg, Leslie Ann and Goldberg, Paul W. and Hu, Zengjian and Martin, Russell}, journal=SIAMJComput, volume={37}, number={4}, pages={1163--1181}, year={2007}, publisher={Society for Industrial and Applied Mathematics}, doi="10.1137/060660345" } @Book{BMW56, author = {M. Beckmann and C. B. McGuire and C. B. Winsten}, title = {Studies in the Economics of Transportation}, publisher = {Yale University Press}, year = {1956}, } @article{CFHHSW97, author= {Nicol\`o Cesa-Bianchi and Yoav Freund and David Haussler and David P. Helmbold and Robert E. Schapire and Manfred K. Warmuth}, title= {How to use Expert Advice}, journal= JACM, volume= 44, number= 3, pages= {427--485}, year= 1997, doi="10.1145/258128.258179" } @inproceedings{CKS09, title={On the performance of approximate equilibria in congestion games}, author={Christodoulou, George and Koutsoupias, Elias and Spirakis, Paul G.}, booktitle={Proc. 17th European Symp. Algorithms (ESA'09)}, pages={251--262}, publisher="Springer", year=2009, doi="10.1007/978-3-642-04128-0\_22" } @article{CKV+02, title={Selfish Traffic Allocation for Server Farms}, author={Czumaj, Artur and Krysta, Piotr and V\"{o}cking, Berthold}, journal=SIAMJComput, volume={39}, pages={1957--1987}, year={2010}, doi="10.1137/070693862" } @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}, doi="10.1145/1186810.1186814"} @conference{AAE+08, title={{Fast convergence to nearly optimal solutions in potential games}}, author={Awerbuch, Baruch and Azar, Yossi and Epstein, Amir and Mirrokni, Vahab Seyed and Skopalik, Alexander}, booktitle={Proc. 9th ACM Conf. Electronic Commerce (EC)}, pages={264--273}, year={2008}, publisher=acm, doi="10.1145/1386790.1386832" } @conference{BHLR08, booktitle={Proc. 40th STOC}, pages={373--382}, year={2008}, publisher=acm, author = {Avrim Blum and MohammadTaghi Hajiaghayi and Katrina Ligett and Aaron Roth}, title = {Regret Minimization and the Price of Total Anarchy}, doi="10.1145/1374376.1374430" } @inproceedings{EKM03, title={{Convergence time to Nash equilibria}}, author={Even-Dar, Eyal and Kesselman, Alex and Mansour, Yishay}, booktitle="Proc. 30th Intern. Colloq. Autom. Lang. Program. (ICALP)", pages={193--193}, year={2003}, publisher={Springer}, series="LNCS", number=2719, doi="10.1007/3-540-45061-0\_41" } @inproceedings{EM05, author = "Eyal Even-Dar and Yishay Mansour", title= "Fast Convergence of Selfish Rerouting", booktitle= " Proc. 16th Ann. ACM-SIAM Symp. Discrete Algorithms (SODA)", publisher=acm, pages = "772--781", year="2005", eprint="acm:1070432.1070541"} @inproceedings{EMN09, title={{On the convergence of regret minimization dynamics in concave games}}, author={Even-Dar, Eyal and Mansour, Yishay and Nadav, Uri}, booktitle={Proc. 41st STOC}, pages={523--532}, year={2009}, publisher=acm, doi="10.1145/1536414.1536486" } @inproceedings{FLM+03, Author = {Alex Fabrikant and Ankur Luthra and Elitza Maneva and Christos H. Papadimitriou and Scott Shenker}, Booktitle = {Proc. 22nd Symp. Principles of Distrib. Comput. (PODC)}, Isbn = {1-58113-708-7}, Location = {Boston, Massachusetts}, Pages = {347--351}, Publisher = acm, Title = {On a network creation game}, Year = {2003}, doi="10.1145/872035.872088"} @InProceedings{FRV06, author = {Simon Fischer and Harald R\"{a}cke and Berthold V\"{o}cking}, title = {Fast Convergence to {W}ardrop Equilibria by Adaptive Sampling Methods}, booktitle = {Proc. 38th STOC}, publisher=acm, year = {2006}, pages="653--662", doi="10.1145/1132516.1132608" } @article{FS97, author= {Yoav Freund and Robert E. Schapire}, title= {A decision-theoretic generalization of on-line learning and an application to boosting}, journal= JComputSystemSci, publisher= {Elsevier}, volume= 55, number= 1, pages= {119--139}, year= 1997, doi="10.1006/jcss.1997.1504" } @article{FS99, author= {Yoav Freund and Robert E. Schapire}, title= {Adaptive game playing using multiplicative weights}, journal= GamesEconomBehav, publisher= {Elsevier}, volume= 29, pages= {79--103}, year= 1999, doi="10.1006/game.1999.0738" } @InProceedings{FV04, author = {Simon Fischer and Berthold V\"{o}cking}, title = {On the Evolution of Selfish Routing}, booktitle = {Proc. 12th European Symp. Algorithms (ESA)}, pages = {323--334}, publisher={Springer}, year = {2004}, series="LNCS", number=3221, doi="10.1007/978-3-540-30140-0\_30" } @article{FV05, title={{Adaptive routing with stale information}}, author={Fischer, Simon and V\"{o}cking, Berthold}, journal=tcs, volume={410}, number={36}, pages={3357--3371}, year={2009}, publisher={Elsevier}, doi="10.1016/j.tcs.2008.01.055" } @Article{FV97, author = {Dean P. Foster and Rakesh V. Vohra}, title = {Calibrated Learning and Correlated Equilibrium}, journal = GamesEconomBehav, year = {1997}, volume=21, number="1--2", pages="40--55", doi="10.1006/game.1997.0595" } @Article{HM00, author = {Sergiu Hart and Andreu Mas-Colell}, title = {A simple adaptive procedure leading to correlated equilibrium}, journal = Econometrica, year = {2000}, volume = {68}, number = {5}, pages = {1127--1150}, doi="10.1111/1468-0262.00153" } @incollection{Han57, author= {J.F. Hannan}, title= {Approximation to {B}ayes Risk in repeated play}, editor= {M. Dresher and A.W. Tucker and P. Wolfe}, booktitle= {Contributions to the Theory of Games}, volume= {III}, pages= {97--139}, publisher= {Princeton University Press}, year= 1957 } @article{KP09, title={{Worst-case equilibria}}, author={Koutsoupias, Elias and Papadimitriou, Christos}, journal=CompSciRev, volume={3}, number={2}, pages={65--69}, year={2009}, doi="10.1016/j.cosrev.2009.04.003" } @InProceedings{KPT09, author = {Robert Kleinberg and Georgios Pillouras and {\'E}va Tardos}, title = {Multiplicative updates outperform generic no-regret learning in congestion games}, booktitle = {Proc. 41st STOC}, year = {2009}, publisher=acm, doi="10.1145/1536414.1536487" } @ARTICLE(KV03, AUTHOR="Adam Kalai and Santosh Vempala", TITLE="Efficient Algorithms for Online Decision Problems", JOURNAL=JComputSystemSci, VOLUME=71, number=3, YEAR=2005, PAGES="291--307", doi="10.1016/j.jcss.2004.10.016" ) @article{LW94, author = {N. Littlestone and M.~K. Warmuth}, title = {The Weighted Majority Algorithm}, journal= InformandComput, volume= 108, number= 2, pages= {212--261}, year= 1994, doi="10.1006/inco.1994.1009" } @article{M96, author = "Igal Milchtaich", title= "Congestion Games with Player-Specific Payoff Functions", journal = GamesEconomBehav, volume= "13", number=1, pages="111--124", year="1996", doi="10.1006/game.1996.0027" } @inproceedings{MB04, author={H. Brendan McMahan and Avrim Blum}, title={Online Geometric Optimization in the Bandit Setting against an Adaptive Adversary}, booktitle={Proc. 17th Ann. Conf. Learning Theory (COLT)}, pages={109--123}, publisher="Springer", series="LNCS", number=3120, year=2004, eprint={springer:38p3f4h61cgy7gg7} } @Article{Mil00, author = {Igal Milchtaich}, title = {Generic uniqueness of equilibrium in large crowding games}, journal = MathOperRes, year = {2000}, volume = {25}, number = {3}, publisher={INFORMS}, pages = {349--364}, doi="10.1287/moor.25.3.349.12220" } @Article{Neyman97, author = {Abraham Neyman}, title = {Correlated Equilibrium and Potential Games}, journal = InternatJGameTheory, year = {1997}, volume = {26}, number=2, publisher={Springer}, pages = {223--227}, doi="10.1007/BF01295851" } @inproceedings{PG04, title={{Bounds for the convergence rate of randomized local search in a multiplayer load-balancing game}}, author={Goldberg, Paul W.}, booktitle={Proc. 23rd Ann. ACM Symp. Principles of Distrib. Comput. (PODC)}, pages={131--140}, year={2004}, publisher=acm, doi="10.1145/1011767.1011787" } @article{RT+02, 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}, doi="10.1145/506147.506153"} @article{RT04, title={{Bounding the inefficiency of equilibria in nonatomic congestion games}}, author={Roughgarden, Tim and Tardos, {\'E}va}, journal=GamesEconomBehav, volume={47}, number={2}, pages={389--403}, year={2004}, publisher={Elsevier}, doi="10.1016/j.geb.2003.06.004" } @InProceedings{Rou09, author = {Tim Roughgarden}, title = {Intrinsic Robustness of the Price of Anarchy}, booktitle = {Proc. 41st STOC}, publisher = acm, pages={513--522}, year = {2009}, doi="10.1145/1536414.1536485" } @Article{S01, author = {William H. Sandholm}, title= {Potential Games with Continuous Player Sets}, journal = JEconomTheory, volume = 97, number=1, year = {2001}, publisher={Elsevier}, pages = {81--108}, doi="10.1006/jeth.2000.2696" } @Article{Sch73, author = {David Schmeidler}, title = {Equilibrium points of nonatomic games}, journal = JStatPhys, year = {1973}, volume = {7}, number = {4}, pages = {295--300}, publisher={Springer}, doi="10.1007/BF01014905" } @article{TW02, title={{Path kernels and multiplicative updates}}, author={Takimoto, Eiji and Warmuth, Manfred K.}, journal=JMachLearnRes, volume={4}, pages={818}, year={2003}, publisher={MIT Press}, note = {\href{http://jmlr.csail.mit.edu/papers/volume4/takimoto03a/takimoto03a.pdf}{http://mlr.csail.mit.edu/papers/volume4/takimoto03a/takimoto03a.pdf}}, } @inproceedings{Z03, author="Martin Zinkevich", title="Online Convex Programming and Generalized Infinitesimal Gradient Ascent", booktitle="Proc. 20th Intern. Conf. Mach. Learn. (ICML)", pages = "928--936", publisher="AAAI Press", year="2003", pdf="http://www.cs.cmu.edu/~maz/publications/ICML03.pdf"} @TechReport{Z04, author = {Martin Zinkevich}, title = {Theoretical Guarantees for Algorithms in Multi-Agent Settings}, institution = {Carnegie Mellon University}, year = {2004}, number = {CMU-CS-04-161} } %%%%%%%%%%%%%%%%%%%%%%%%%% %%%%% bib of v006a009 %%%%%%%%%%%%%%%%%%%%%%%%%% %% Theory of Computing %% File: v006a009.bib %% Publication date: November 15, 2010 %% Authors: Paul Beame, Matei David, Toniann Pitassi, and Philipp Woelfel %% Theory of Computing %% File: v006a008.bib %% Publication date: September 15, 2010 %% Authors: Paul Beame, Matei David, Toniann Pitassi, and Philipp Woelfel @comment{Theory of Computing} @string{j:toc = {Theory of Computing}} @comment{Journal of Computer and System Sciences} @string{JComputSystemSci="J. Comput. System Sci."} @comment{SIAM Journal on Computing} @string{SIAMJComput="SIAM J. Comput."} @comment{Computational Complexity} @string{CompComplex="Comput. Complexity"} @comment{SIAM Journal on Discrete Mathematics} @string{SIAMJDiscreteMath="SIAM J. Discrete Math."} @comment{ACM Transactions on Computational Theory} @string{ACMTransComputTheory="ACM Trans. Comput. Log."} @comment{Theoretical Computer Science} @string{TheoretComputSci="Theoret. Comput. Sci."} @comment{Information Processing Letters} @string{InformProcessLett="Inform. Process. Lett."} @comment{Electronic Colloquium on Computational Complexity (ECCC)} @string{eccc="Electron. Colloq. on Comput. Complexity (ECCC)"} @comment{Combinatorica. An International Journal on Combinatorics and the Theory of Computing} @string{Combinatorica="Combinatorica"} @comment{Izvestiya. Mathematics} @string{IzvMath="Izv. Math."} @comment{Bulletin of the European Association for Theoretical Computer Science. EATCS} @string{BullEurAssocTheorComputSciEATCS="Bull. Eur. Assoc. Theor. Comput. Sci. EATCS"} @string{ieee="IEEE Comput. Soc. Press"} @string{acm="ACM Press"} @inproceedings{bfs-classes, author = {L{\'a}szl{\'o} Babai and P{\'e}ter Frankl and J{\'a}nos Simon}, title = {Complexity classes in communication complexity theory {\rm(}preliminary version{\rm)}}, booktitle = "Proc. 27th FOCS", year = {1986}, pages = {337--347}, publisher = ieee, doi = {10.1109/SFCS.1986.15}, } @article{bgkl-sim, author = {L\'{a}szl\'{o} Babai and Anna G\'{a}l and Peter Kimmel and Satyanarayana Lokam}, title = {Communication Complexity of Simultaneous Messages}, journal = SIAMJComput, volume = {33}, number = {1}, year = {2004}, issn = {0097-5397}, pages = {137--166}, doi = {10.1137/S0097539700375944}, publisher = {Society for Industrial and Applied Mathematics}, address = {Philadelphia, PA, USA}, } @article{bhk-missing, author = {L{\'a}szl{\'o} Babai and Thomas Hayes and Peter Kimmel}, title = {The Cost of the Missing Bit: Communication Complexity with Help}, journal = Combinatorica, volume = {21}, number = {4}, year = {2001}, pages = {455--488}, ee = {http://link.springer.de/link/service/journals/00493/bibs/1021004/10210455.htm}, bibsource = {DBLP, http://dblp.uni-trier.de} } @article{bns-gip, author = {L\'{a}szl\'{o} Babai and Noam Nisan and M\'{a}ri\'{o} Szegedy}, title = {Multiparty protocols, pseudorandom generators for logspace, and time-space trade-offs}, journal = JComputSystemSci, volume = {45}, number = {2}, year = {1992}, issn = {0022-0000}, pages = {204--232}, doi = {10.1016/0022-0000(92)90047-M}, publisher = {Academic Press, Inc.}, address = {Orlando, FL, USA}, } @inproceedings{bdpw-separation, author = {Paul Beame and Matei David and Toniann Pitassi and Philipp Woelfel}, title = {Separating Deterministic from Nondeterministic {NOF} Multiparty Communication Complexity}, booktitle = "Proc. 34th Intern. Colloq. Autom. Lang. Program. (ICALP)", pages = {134--145}, ee = {10.1007/978-3-540-73420-8\_14}, bibsource = {DBLP, http://dblp.uni-trier.de}, series = "LNCS", volume = {4596}, year = {2007}, publisher = {Springer}, isbn = {978-3-540-73419-2}, bibsource = {DBLP, http://dblp.uni-trier.de} } @inproceedings{bhp-hardness, author = {Paul Beame and Trinh Huynh and Toniann Pitassi}, title = {Hardness amplification in proof complexity}, booktitle = "Proc. 42nd STOC", publisher = acm, year = {2010}, pages = {87--96}, doi = {10.1145/1806689.1806703}, bibsource = {DBLP, http://dblp.uni-trier.de} } @inproceedings{bhn-disj, author = {Paul Beame and Dang-Trinh Huynh-Ngoc}, title = {Multiparty communication complexity and threshold circuit size of {AC}$^0$}, booktitle = "Proc. 50th FOCS", pages = {53--62}, doi = {10.1109/FSCS.2009.12}, publisher = ieee, year = {2009}, isbn = {978-0-7695-3850-1}, bibsource = {DBLP, http://dblp.uni-trier.de} } @article{bps-ls, author = {Paul Beame and Toniann Pitassi and Nathan Segerlind}, title = {Lower Bounds for {L}ov{\'a}sz--{S}chrijver Systems and Beyond Follow from Multiparty Communication Complexity}, journal = SIAMJComput, fjournal = {SIAM Journal on Computing}, volume = {37}, number = {3}, year = {2007}, pages = {845--869}, doi = {10.1137/060654645}, bibsource = {DBLP, http://dblp.uni-trier.de} } @inproceedings{bgg-exactt, author = {Richard Beigel and William Gasarch and James Glenn}, title = {The Multiparty Communication Complexity of {E}xact-{T}: Improved Bounds and New Problems}, pages = {146--156}, doi = {10.1007/11821069\_13}, booktitle = "Proc. 31st. Intern. Symp. Math. Found. Comput. Sci. (MFCS)", publisher = {Springer}, series = "LNCS", volume = {4162}, year = {2006}, isbn = {3-540-37791-3}, bibsource = {DBLP, http://dblp.uni-trier.de} } @article{bt-acc, author = {Beigel, Richard and Tarui, Jun}, title = {On {ACC}}, journal = CompComplex, volume = {4}, number = {4}, year = {1994}, issn = {1016-3328}, pages = {350--366}, doi = {10.1007/BF01263423}, publisher = {Birkh{\"a}user Verlag}, address = {Basel, Switzerland, Switzerland}, } @article{cw-univ, title = "Universal classes of hash functions", journal = JComputSystemSci, volume = "18", number = "2", pages = "143--154", year = "1979", note = "", issn = "0022-0000", doi = "10.1016/0022-0000(79)90044-8", url = "http://www.sciencedirect.com/science/article/B6WJ0-4B55K9J-D/2/036439eff8b0d54d7974c2d5d6997669", author = "J. Lawrence Carter and Mark N. Wegman" } @inproceedings{cfl-nof, author = {Ashok K. Chandra and Merrick L. Furst and Richard J. Lipton}, title = {Multi-party protocols}, booktitle = "Proc. 15th STOC", publisher = acm, pages = {94--99}, year = {1983}, doi = {10.1145/800061.808737}, } @techreport{ca-disj, author = {Arkadev Chattopadhyay and Anil Ada}, title = {Multiparty Communication Complexity of Disjointness}, institution = eccc, number = {TR08-002}, year = {2008}, ee = {http://eccc.hpi-web.de/eccc-reports/2008/TR08-002/index.html}, bibsource = {DBLP, http://dblp.uni-trier.de} } @article {ct-gip, AUTHOR = {Chung, Fan R. K. and Tetali, Prasad}, TITLE = {Communication complexity and quasi randomness}, JOURNAL = SIAMJDiscreteMath, FJOURNAL = {SIAM Journal on Discrete Mathematics}, VOLUME = {6}, YEAR = {1993}, NUMBER = {1}, PAGES = {110--123}, ISSN = {0895-4801}, CODEN = {SJDMEC}, MRCLASS = {05D05 (05C65 68M10 68Q30)}, MRNUMBER = {MR1201994 (93k:05181)}, doi = {10.1137/0406009}, } @article{dpv-separation, author = {David, Matei and Pitassi, Toniann and Viola, Emanuele}, title = {Improved Separations between Nondeterministic and Randomized Multiparty Communication}, journal = ACMTransComputTheory, volume = {1}, number = {2}, year = {2009}, issn = {1942-3454}, pages = {1--20}, doi = {10.1145/1595391.1595392}, publisher = acm, address = {New York, NY, USA}, } @inproceedings{fg-hadamard, author = {Jeff Ford and Anna G{\'a}l}, title = {Hadamard Tensors and Lower Bounds on Multiparty Communication Complexity}, booktitle = {Complexity of Boolean Functions}, ee = {http://drops.dagstuhl.de/opus/volltexte/2006/607}, bibsource = {DBLP, http://dblp.uni-trier.de}, publisher = {IBFI}, series = {Dagstuhl Seminar Proceedings}, volume = {06111}, year = {2006}, } @article{gs-npconp, author = {Dmitry Gavinsky and Alexander A. Sherstov}, title = {A Separation of {NP} and {coNP} in Multiparty Communication Complexity}, journal = j:toc, year = {2010}, volume = 6, pages = {227-245}, doi = {10.4086/toc2010.v006a010}, } @article{hg-threshold, author = {Johan H\aa{}stad and Mikael Goldmann}, title = {On the power of small-depth threshold circuits}, journal = CompComplex, volume = {1}, number = {2}, pages = {113--129}, year = {1991}, doi = {10.1007/BF01272517}, } @article{kla-gendisc, author = {Klauck, Hartmut}, title = {Lower Bounds for Quantum Communication Complexity}, journal = SIAMJComput, volume = {37}, number = {1}, year = {2007}, issn = {0097-5397}, pages = {20--46}, doi = {10.1137/S0097539702405620}, publisher = {Society for Industrial and Applied Mathematics}, address = {Philadelphia, PA, USA}, } @book{kn-book, author = {Eyal Kushilevitz and Noam Nisan}, title = {Communication Complexity}, year = {1997}, isbn = {0-521-56067-5}, publisher = {Cambridge University Press}, } @inproceedings{ls-disj, author = {Troy Lee and Adi Shraibman}, title = {Disjointness Is Hard in the Multi-party Number-on-the-Forehead Model}, booktitle = "Proc. 23rd Comput. Complex. Conf. (CCC)", year = {2008}, isbn = {978-0-7695-3169-4}, pages = {81--91}, doi = {10.1109/CCC.2008.29}, publisher = ieee, } @article{mnt-univ, author = {Yishay Mansour and Noam Nisan and Prasoon Tiwari}, title = {The Computational Complexity of Universal Hashing}, journal = TheoretComputSci, fjournal = {Theoretical Computer Science}, volume = {107}, number = {1}, year = {1993}, pages = {121--133}, bibsource = {DBLP, http://dblp.uni-trier.de}, doi = {10.1016/0304-3975(93)90257-T}, } @article{newman-private, author = {Ilan Newman}, title = {Private vs. Common Random Bits in Communication Complexity}, journal = InformProcessLett, volume = {39}, number = {2}, year = {1991}, pages = {67--71}, bibsource = {DBLP, http://dblp.uni-trier.de}, doi = {10.1016/0020-0190(91)90157-D}, } @incollection{nisan-gates, author = {Noam Nisan}, title = {The communication complexity of threshold gates}, booktitle = {Combinatorics, Paul {Erd\H{o}s} is Eighty}, year = {1993}, series = {Bolyai Society Mathematical Studies}, number = {1}, publisher = {J. Bolyai Math. Soc., Budapest}, pages = {301--315}, isbn = {963 8022 73 6}, ee = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.57.6891}, } @article{nw-rounds, author = {Noam Nisan and Avi Wigderson}, title = {Rounds in communication complexity revisited}, journal = SIAMJComput, fjournal = {SIAM Journal on Computing}, volume = {22}, number = {1}, year = {1993}, issn = {0097-5397}, pages = {211--219}, doi = {10.1137/0222016}, publisher = {Society for Industrial and Applied Mathematics}, address = {Philadelphia, PA, USA}, } @article{raz-gip, author = {Raz, Ran}, title = {The {BNS}-{C}hung criterion for multi-party communication complexity}, journal = CompComplex, fjournal = {Computational Complexity}, volume = {9}, year = {2000}, number = {2}, pages = {113--122}, issn = {1016-3328}, mrreviewer = {Ulrich Tamm}, doi = {10.1007/PL00001602} } @article{razb-symm, author = {A. A. Razborov}, title = {Quantum communication complexity of symmetric predicates}, journal = IzvMath, volume = 67, number = 1, pages = {145--159}, year = 2003, doi = {10.1070/IM2003v067n01ABEH000422}, comment = {Russian original: Izv. Russian Acad. Sci., Mathematics, vol. 67 (2002), 145--159} } @article{she-survey, author = {Alexander A. Sherstov}, title = {Communication Lower Bounds Using Dual Polynomials}, journal = BullEurAssocTheorComputSciEATCS, volume = {95}, pages = {59--93}, year = {2008}, ee = {http://www.eatcs.org/images/bulletin/beatcs95.pdf}, } @inproceedings{yao-cc, author = {Andrew Chi-Chih Yao}, title = {Some complexity questions related to distributive computing (Preliminary Report)}, booktitle = "Proc. 11th STOC", year = {1979}, pages = {209--213}, location = {Atlanta, Georgia, United States}, publisher = acm, doi = {10.1145/800135.804414}, } @INPROCEEDINGS{yao-acc, author={Andrew Chi-Chih Yao}, title={On {ACC} and threshold circuits}, booktitle={Proc. 31st FOCS}, year={1990}, volume={2}, number={}, pages={619--627}, doi={10.1109/FSCS.1990.89583}, } %%%%%%%%%%%%%%%%%%%%%%%%%% %%%%% bib of v006a010 %%%%%%%%%%%%%%%%%%%%%%%%%% %% Theory of Computing %% File: v006a010.bib %% Publication date: November 16, 2010 %% Authors: Dmitry Gavinsky and Alexander A. Sherstov @comment{SIAM Journal on Computing} @string{SIAMJComput="SIAM J. Comput."} @comment{SIAM Journal on Discrete Mathematics} @string{SIAMJDiscreteMath="SIAM J. Discrete Math."} @comment{Theoretical Computer Science} @string{TheoretComputSci="Theoret. Comput. Sci."} @comment{Journal of Computer and System Sciences} @string{jcss="J. Computer and System Sciences"} @comment{Computational Complexity} @string{CompComplex="Comput. Complexity"} @comment{Izvestiya. Mathematics} @string{IzvMath="Izv. Math."} @comment{Quantum Information & Computation} @string{QuantumInfComput="Quantum Inf. Comput."} @comment{ACM Transactions on Computational Theory} @string{ACMTransComputTheory="ACM Trans. Comput. Log."} @comment{Information Processing Letters} @string{InformProcessLett="Inform. Process. Lett."} @comment{Bulletin of the European Association for Theoretical Computer Science. EATCS} @string{BullEurAssocTheorComputSciEATCS="Bull. Eur. Assoc. Theor. Comput. Sci. (EATCS)"} @comment{Electronic Colloquium on Computational Complexity (ECCC)} @string{eccc="Electron. Colloq. on Comput. Complexity (ECCC)"} @string{ieee="IEEE Comp. Soc. Press"} @string{acm="ACM Press"} @inproceedings{BFS86cc, author = {L{\'a}szl{\'o} Babai and P{\'e}ter Frankl and Janos Simon}, title = {Complexity classes in communication complexity theory}, booktitle = {Proc. 27th FOCS}, year = {1986}, pages = {337--347}, publisher=ieee, doi="10.1109/SFCS.1986.15" } @article{bns92, author = {L{\'a}szl{\'o} Babai and Noam Nisan and M{\'a}ri{\'o} Szegedy}, title = {Multiparty Protocols, Pseudorandom Generators for Logspace, and Time-Space Trade-Offs}, journal = jcss, volume = {45}, number = {2}, year = {1992}, pages = {204--232}, doi="10.1016/0022-0000(92)90047-M" } @article{BDPW10, author = {Paul Beame and Matei David and Toniann Pitassi and Philipp Woelfel}, title = {Separating Deterministic from Randomized Multiparty Communication Complexity}, journal = {Theory of Computing}, year = {2010}, volume = {6}, pages = {201-225}, publisher = {Theory of Computing}, doi = {10.4086/toc.2010.v006a009}, URL = {http://www.theoryofcomputing.org/articles/v006a009}, comment = {Preliminary version: ``Separating Deterministic from Nondeterministic {NOF} Multiparty Communication Complexity,'' 34th ICALP, 2007, pp. 134--145} } @article{bps07lovasz-schrijver, author = {Paul Beame and Toniann Pitassi and Nathan Segerlind}, title = {Lower Bounds for {L}ov{\'a}sz-{S}chrijver Systems and Beyond Follow from Multiparty Communication Complexity}, journal = SIAMJComput, volume = {37}, number = {3}, year = {2007}, pages = {845--869}, doi="10.1137/060654645" } @inproceedings{cfl83multiparty, author = {Ashok K. Chandra and Merrick L. Furst and Richard J. Lipton}, title = {Multi-Party Protocols}, booktitle = {Proc. 15th STOC}, year = {1983}, pages = {94--99}, publisher=acm, doi="10.1145/800061.808737" } @inproceedings{arkadev07multiparty, author = {Arkadev Chattopadhyay}, title = {Discrepancy and the power of bottom fan-in in depth-three circuits}, booktitle = {Proc. 48th FOCS}, pages = {449--458}, year = {2007}, publisher=ieee, doi="10.1109/FOCS.2007.30" } @inproceedings{chatt-ada08disjointness, author = "Arkadev Chattopadhyay and Anil Ada", title = "Multiparty Communication Complexity of Disjointness", booktitle = eccc, month = "January", year = "2008", note = "Report TR08-002", eprint="eccc:TR08-002" } @article{chor-goldreich88ip, author = {Benny Chor and Oded Goldreich}, title = {Unbiased Bits from Sources of Weak Randomness and Probabilistic Communication Complexity}, journal = SIAMJComput, volume = {17}, number = {2}, year = {1988}, pages = {230--261}, doi="10.1137/0217015" } @article{chung-tetali93, author = {Fan R. K. Chung and Prasad Tetali}, title = {Communication Complexity and Quasi Randomness}, journal = SIAMJDiscreteMath, volume = {6}, number = {1}, year = {1993}, pages = {110--123}, doi="10.1137/0406009" } @book{dewolf, author = {Ronald de Wolf}, title = {A Brief Introduction to Fourier Analysis on the Boolean Cube}, year = {2008}, pages = {1--20}, series = {Graduate Surveys}, number = {1}, publisher = {Theory of Computing Library}, doi = {10.4086/toc.gs.2008.001}, URL = {http://www.theoryofcomputing.org/library.html}, } @inproceedings{pitassi08np-rp, author = "Matei David and Toniann Pitassi", title = "Separating {NOF} communication complexity classes {$\mathsf{RP}$} and {$\mathsf{NP}$}", booktitle = eccc, month = "February", year = "2008", note = "Report TR08-014", eprint="eccc:TR08-014", } @article{david-pitassi-viola08bpp-np, author = {Matei David and Toniann Pitassi and Emanuele Viola}, title = {Improved Separations between Nondeterministic and Randomized Multiparty Communication}, journal = ACMTransComputTheory, volume = {1}, number = {2}, year = {2009}, doi="10.1145/1595391.1595392" } @article{hastad-goldman91multiparty, author = {Johan H{\aa}stad and Mikael Goldmann}, title = {On the Power of Small-Depth Threshold Circuits}, journal = CompComplex, volume = {1}, year = {1991}, pages = {113--129}, doi="10.1007/BF01272517", number=2 } @article{KS92disj, author = {Bala Kalyanasundaram and Georg Schnitger}, title = {The Probabilistic Communication Complexity of Set Intersection}, journal = SIAMJDiscreteMath, volume = {5}, number = {4}, year = {1992}, pages = {545--557}, doi="10.1137/0405044" } @inproceedings{klauck01quantum, author = {Hartmut Klauck}, title = {Lower Bounds for Quantum Communication Complexity}, booktitle = {Proc. 42nd FOCS}, year = {2001}, pages = {288--297}, publisher=ieee, doi="10.1109/SFCS.2001.959903" } @article{klauck01quantum-journal, author = {Hartmut Klauck}, title = {Lower Bounds for Quantum Communication Complexity}, journal = SIAMJComput, volume = {37}, number = {1}, year = {2007}, pages = {20--46}, doi="10.1137/S0097539702405620" } @inproceedings{klauck03rect, author = {Hartmut Klauck}, title = {Rectangle Size Bounds and Threshold Covers in Communication Complexity}, booktitle = {Proc. 18th Conf. Comput. Complexity (CCC)}, year = {2003}, pages = {118--134}, publisher=ieee, doi="10.1109/CCC.2003.1214415" } @book{ccbook, author = {Eyal Kushilevitz and Noam Nisan}, title = {Communication Complexity}, year = {1997}, publisher = {Cambridge University Press}, address = {New York}, } @inproceedings{lee-shraibman08disjointness, author = "Troy Lee and Adi Shraibman", title = "Disjointness is hard in the multi-party number-on-the-forehead model", booktitle = {Proc. 23rd Conf. Comput. Complexity (CCC)}, year = {2008}, pages = {81--91}, publisher=ieee, doi="10.1109/CCC.2008.29" } @inproceedings{linial07factorization-stoc, author = {Nati Linial and Adi Shraibman}, title = {Lower bounds in communication complexity based on factorization norms}, booktitle = "Proc. 39th STOC", year = {2007}, pages = {699--708}, publisher=acm, doi="10.1145/1250790.1250892" } @article{nisan-szegedy94degree, author = {Noam Nisan and Mario Szegedy}, title = {On the Degree of {B}oolean Functions as Real Polynomials}, journal = CompComplex, volume = {4}, number = 4, year = {1994}, pages = {301--313}, doi="10.1007/BF01263419" } @inproceedings{papadimitriou-sipser82cc, author = {Christos H. Papadimitriou and Michael Sipser}, title = {Communication complexity}, booktitle = {Proc. 14th STOC}, year = {1982}, pages = {196--200}, publisher=acm, doi="10.1145/800070.802192" } @inproceedings{paturi92approx, author = {Ramamohan Paturi}, title = {On the Degree of Polynomials that Approximate Symmetric {B}oolean Functions}, booktitle = {Proc. 24th STOC}, year = {1992}, pages = {468--474}, publisher=acm, doi="10.1145/129712.129758" } @article{raz00multiparty, author = {Ran Raz}, title = {The {BNS-Chung} criterion for multi-party communication complexity}, journal = CompComplex, volume = {9}, number = {2}, year = {2000}, pages = {113--122}, doi="10.1007/PL00001602" } @article{razborov90disj, author = {A. A. Razborov}, title = {On the distributional complexity of disjointness}, journal = TheoretComputSci, volume = {106}, number = {2}, year = {1992}, pages = {385--390}, publisher = {Elsevier Science Publishers Ltd.}, address = {Essex, UK}, doi="10.1016/0304-3975(92)90260-M" } @article{razborov03quantum, author = "A. A. Razborov", title = {Quantum Communication Complexity of Symmetric Predicates}, journal = IzvMath, volume = {67}, number = {1}, year = {2003}, pages = {145--159}, doi="10.1070/IM2003v067n01ABEH000422", comment = {Russian original: Izv. Russian Acad. Sci, Mathematics, vol. 67 (2002), 145--159} } @article{razborov-wigderson93multiparty, author = {Alexander Razborov and Avi Wigderson}, title = {{$n^{\Omega(\log n)}$} Lower Bounds on the Size of Depth-$3$ Threshold Circuits with {AND} Gates at the Bottom}, journal = InformProcessLett, volume = {45}, number = {6}, year = {1993}, pages = {303--307}, doi="10.1016/0020-0190(93)90041-7" } @article{sherstov07ac-majmaj, author = {Alexander A. Sherstov}, title = {Separating {$\mathsf{AC}^0$} from Depth-2 Majority Circuits}, year = {2009}, journal = SIAMJComput, volume = {38}, number = {6}, pages = {2113--2129}, note = {Preliminary version in 39th STOC, 2007}, doi="10.1137/08071421X" } @inproceedings{sherstov07quantum, author = "Alexander A. Sherstov", title = "The Pattern Matrix Method for Lower Bounds on Quantum Communication", booktitle = "Proc. 40th STOC", year = "2008", pages = "85--94", publisher=acm, doi="10.1145/1374376.1374392" } @article{dual-survey, author = "Alexander A. Sherstov", title = "Communication Lower Bounds Using Dual Polynomials", journal = BullEurAssocTheorComputSciEATCS, volume = 95, pages = {59--93}, year = "2008", } @article{shi-zhu07block-composed, title = {Quantum communication complexity of block-composed functions}, author = {Yaoyun Shi and Yufan Zhu}, journal = QuantumInfComput, pages = {444--460}, volume = 9, number = {5--6}, year = 2009, } @inproceedings{yao90multiparty, author = {Andrew Chi-Chih Yao}, title = {On $\mathsf{ACC}$ and Threshold Circuits}, booktitle = {Proc. 31st FOCS}, year = {1990}, pages = {619--627}, publisher=ieee, doi="10.1109/FSCS.1990.89583" } %%%%%%%%%%%%%%%%%%%%%%%%%% %%%%% bib of v006a011 %%%%%%%%%%%%%%%%%%%%%%%%%% %% Theory of Computing %% File: v006a011.bib %% Publication date: December 9, 2010 %% Authors: Uriel Feige and Jan Vondrak @comment{Mathematical Programming. A Publication of the Mathematical Programming Society} @string{MathProgram="Math. Program."} @comment{SIAM Journal on Computing} @string{SIAMJComput="SIAM J. Comput."} @comment{Games and Economic Behavior} @string{GamesEconomBehav="Games Econom. Behav."} @comment{Mathematics of Operations Research} @string{MathOperRes="Math. Oper. Res."} @comment{Algorithmica. An International Journal in Computer Science} @string{Algorithmica="Algorithmica"} @comment{Journal of Economic Theory} @string{JEconomTheory="J. Econom. Theory"} @comment{Acta Mathematica} @string{ActaMath="Acta Math."} @comment{Journal of the ACM} @string{JACM="J. ACM"} @comment{Mathematical Programming Studies} @string{MathProgStud="Math. Program. Stud."} @comment{Artificial Intelligence} @string{ArtificialIntelligence="Artificial Intelligence"} @string{ieee="IEEE Comp. Soc. Press"} @string{acm="ACM Press"} @book{BT, author = {Steven J. Brams and Alan D. Taylor}, title = {Fair division: From cake-cutting to dispute resolution}, year = {1996}, address = {}, publisher = {Cambridge University Press}, } @inproceedings{CCPV07, author = {Gruia Calinescu and Chandra Chekuri and Martin P\'al and Jan Vondr\'ak}, title = {Maximizing a submodular set function subject to a matroid constraint}, booktitle = "Proc. 12th Intern. Conf. Integer Program. Comb. Opt. (IPCO)", year = {2007}, pages = {182--196}, series="LNCS", volume=4513, doi={10.1007/978-3-540-72792-7\_15}, publisher = "Springer", } @article{CG08, author = {Deeparnab Chakrabarty and Gagan Goel}, title = {On the approximability of budgeted allocations and improved lower bounds for submodular welfare maximization and {GAP}}, journal=SIAMJComput, volume=39, number=6, year=2010, pages="2189--2211", note="Preliminary version appeared in Proc. 49th FOCS, 2008", doi="10.1137/080735503"} @article{DNS, author = {Shahar Dobzinski and Noam Nisan and Michael Schapira}, title = {Approximation algorithms for combinatorial auctions with complement-free bidders}, journal=MathOperRes, volume=35, number=1, year=2010, pages="1--13", note="Preliminary version appeared in Proc. 37th STOC, 2005", doi={10.1287/moor.1090.0436}, publisher=acm, } @inproceedings{DS, author = {Shahar Dobzinski and Michael Schapira}, title = {An improved approximation algorithm for combinatorial auctions with submodular bidders}, booktitle = {Proc. 17th SODA}, year = {2006}, pages = {1064--1073}, doi={10.1145/1109557.1109675} } @article{FHKS, author = {Uriel Feige and Magnus Halldorsson and Guy Kortsarz and Aravind Srinivasan}, title = {Approximating the domatic number}, journal = SIAMJComput, year = {2002}, month = {}, volume = {32}, number = {1}, pages = {172--195}, doi={10.1137/S0097539700380754} } @article{Feige98, author = {Uriel Feige}, title = {A threshold of $\ln n$ for approximating set cover}, journal = JACM, year = {1998}, month = {}, volume = {45}, number = {4}, pages = {634--652}, doi={10.1145/285055.285059} } @inproceedings{F06, author = {Uriel Feige}, title = {Maximizing social welfare when utility functions are subadditive}, booktitle = {Proc. 38th STOC}, year = {2006}, pages = {41--50}, doi={10.1145/285055.285059}, publisher=acm, } @inproceedings{FV06, author = {Uriel Feige and Jan {Vondr\'ak}}, title = {Approximation algorithms for combinatorial allocation problems: {Improving} the factor of $1-1/{\mathrm e}$}, booktitle = {Proc. 47th FOCS}, year = {2006}, pages = {667--676}, doi={10.1109/FOCS.2006.14}, publisher=ieee, } @book{GJ79, author = {Michael R. Garey and David S. Johnson}, title = {Computers and intractibility: A guide to the theory of NP-completeness}, year = {1979}, address = {}, publisher = {Freeman}, } @inproceedings{HSS, author = {Elad Hazan and Shmuel Safra and Oded Schwartz}, title = {On the complexity of approximating $k$-dimensional matching}, booktitle = {Proc. 6th Intern. Workshop Approx. Algorithms for Comb. Opt. (APPROX)}, year = {2003}, series="LNCS", volume=2764, pages = {83--97}, doi={10.1007/978-3-540-45198-3\_8}, publisher="Springer", } @article{Hastad99, author = {Johan H{\aa}stad}, title = {Clique is hard to approximate within {$n$} to the power {$1-\epsilon$}}, journal = ActaMath, year = {1999}, month = {}, volume = {182}, number=1, pages = {105--142}, doi={10.1007/BF02392825} } @article{KLMM, author = {Subhash Khot and Richard Lipton and Evangelos Markakis and Aranyak Mehta}, title = {Inapproximability results for combinatorial auctions with submodular utility functions}, journal=Algorithmica, volume=52, number=1, year=2008, pages="3--18", note="Preliminary version appeared in Proc. 1st Intern. Workshop Internet and Network Economics (WINE), 2005", doi={10.1007/s00453-007-9105-7}} @article{LLN, author = {Benny Lehmann and Daniel Lehmann and Noam Nisan}, title = {Combinatorial auctions with decreasing marginal utilities}, journal=GamesEconomBehav, volume=55, number=2, year=2006, pages="270--296", note="Preliminary version appeared in Proc. Conf. Electron. Commerce 2001", doi={10.1016/j.geb.2005.02.006}} @article{LY, author = {Carsten Lund and Mihalis Yannakakis}, title = {On the hardness of approximating minimization problems}, journal = JACM, year = {1994}, month = {}, volume = {41}, number = {5}, pages = {960--981}, doi={10.1145/185675.306789} } @article{NS, author = {Noam Nisan and Ilya Segal}, title = {The communication requirements of efficient allocations and supporting prices}, journal = JEconomTheory, Volume=129, number=1, year = {2006}, pages="192--224", doi={10.1016/j.jet.2004.10.007} } @article{NWF78, author = {George L. Nemhauser and Lawrence A. Wolsey and Marshall L. Fisher}, title = {An analysis of approximations for maximizing submodular set functions I}, journal = MathProgram, year = {1978}, month = {}, volume = {14}, number=1, pages = {265--294}, doi="10.1007/BF01588971", } @article{NWF78II, author = {Marshall L. Fisher and George L. Nemhauser and Lawrence A. Wolsey}, title = {An analysis of approximations for maximizing submodular set functions---{II}}, journal = MathProgStud, year = {1978}, month = {}, volume = {8}, pages = {73--87}, doi={10.1007/BFb0121195} } @article{Sandholm02, author = {Tuomas Sandholm}, title = {Algorithm for optimal winner determination in combinatorial auctions}, journal = ArtificialIntelligence, year = {2002}, month = {}, volume = {135}, pages = {1--54}, doi={10.1016/S0004-3702(01)00159-X} } @inproceedings{V08, author = {Jan Vondr\'ak}, title = {Optimal approximation for the Submodular Welfare Problem in the value oracle model}, booktitle = {Proc. 40th STOC}, year = {2008}, pages = {67--74}, doi={10.1145/1374376.1374389}, publisher=acm, } @phdthesis{VondrakPhd2, author = {Jan Vondr\'ak}, title = {Submodularity in combinatorial optimization}, year = {2007}, school = {Charles University, Prague, Czech republic}, } %%%%%%%%%%%%%%%%%%%%%%%%%% %%%%% bib of v006a012 %%%%%%%%%%%%%%%%%%%%%%%%%% %% Theory of Computing %% File: v006a012.bib %% Publication date: December 31, 2010 %% Authors: Zeev Dvir and Avi Wigderson %% Theory of Computing %% File: v006a012.bib %% Publication date: December 12, 2010 %% Authors: Zeev Dvir and Avi Wigderson %% Theory of Computing %% File: v006a011.bib %% Publication date: December 12, 2010 %% Authors: Zeev Dvir and Avi Wigderson %% Theory of Computing %% File: v006a011.bib %% Publication date: September 25, 2010 %% Authors: Zeev Dvir and Avi Wigderson @comment{Inventiones Mathematicae} @string{InventMath="Invent. Math."} @comment{Rossiiskaya Akademiya Nauk. Problemy Peredachi Informatsii} @string{ProblemyPeredachiInformatsii="Problemy Peredachi Informatsii"} @comment{Quantum Information & Computation} @string{QuantumInfComput="Quantum Inf. Comput."} @comment{Bulletin of the London Mathematical Society} @string{BullLondMathSoc="Bull. Lond. Math. Soc."} @comment{Journal of the ACM} @string{JACM="J. ACM"} @comment{Journal of Algebra} @string{JAlgebra="J. Algebra"} @comment{SIAM Journal on Applied Mathematics} @string{SIAMJApplMath="SIAM J. Appl. Math."} @comment{SIAM. J. on Algebraic and Discrete Methods} @string{SIAMJAlgDisMeth="SIAM J. Algebr. Discrete Methods"} @comment{SIAM Journal on Computing} @string{SIAMJComput="SIAM J. Comput."} @comment{Comptes Rendus Mathematique} @string{CRMath="C. R. Math."} @comment{Combinatorics, Probability and Computing} @string{CombinProbabComput="Combin. Probab. Comput."} @comment{Annals of Mathematics.} @string{AnnofMath="Ann. of Math."} @comment{Journal of Combinatorial Theory. Series B} @string{JCombinTheorySerB="J. Combin. Theory Ser. B"} @comment{Combinatorica. An International Journal on Combinatorics and the Theory of Computing} @string{Combinatorica="Combinatorica"} @comment{Proceedings of the National Academy of Sciences of the United States of America} @string{ProcNatlAcadSciUSA="Proc. Natl. Acad. Sci. USA"} @comment{American Mathematical Society. Bulletin. New Series} @string{BullAmerMathSocNS="Bull. Amer. Math. Soc. (N.S.)"} @comment{Theory of Computing. An Open Access Journal} @string{TheoryComput="Theory of Computing"} @string{ACM="ACM Press"} @string{IEEE="IEEE Comp. Soc. Press"} @article{WX06, author = {Avi Wigderson and David Xiao}, title = {Derandomizing the {A}hlswede-{W}inter matrix-valued {C}hernoff bound using pessimistic estimators, and applications}, journal = TheoryComput, volume = {4}, number = {1}, year = {2008}, pages = {53--76}, doi={10.4086/toc.2008.v004a003}, bibsource = {DBLP, http://dblp.uni-trier.de} } @ARTICLE{HNW06, author = {Shlomo Hoory and Nathan Linial and Avi Wigderson}, title = {Expander graphs and their applications}, journal = BullAmerMathSocNS, year = {2006}, volume = {43}, pages = {439--561}, doi="10.1090/S0273-0979-06-01126-8" } @ARTICLE{KLN06, AUTHOR = "Martin Kassabov and Alexander Lubotzky and Nikolay Nikolov", TITLE = "Finite Simple Groups as Expanders", JOURNAL = ProcNatlAcadSciUSA, YEAR = "2006", volume = "103", number = "16", pages = "6116--6119", doi="10.1073/pnas.0510337103" } @article{LPS88, author = {Alexander Lubotzky and Ralph Phillips and Peter Sarnak}, title = {Ramanujan graphs}, journal = Combinatorica, volume = {8}, number = {3}, year = {1988}, pages = {261--277}, bibsource = {DBLP, http://dblp.uni-trier.de}, doi="10.1007/BF02126799" } @Article{RVW02, author={Omer Reingold and Salil Vadhan and Avi Wigderson}, title={Entropy waves, the zig-zag graph product, and new constant-degree expanders}, journal=AnnofMath, pages={157--187}, volume = {155}, number = {1}, year={2002}, eprint={jstor:3062153} } @article{ASS08, author = {Noga Alon and Oded Schwartz and Assaf Shapira}, title = {An elementary construction of constant-degree expanders}, journal = CombinProbabComput, volume = {17}, number = {3}, year = {2008}, issn = {0963-5483}, pages = {319--327}, doi = {10.1017/S0963548307008851}, publisher = {Cambridge University Press}, address = {New York, NY, USA}, } @ARTICLE{Bou09, AUTHOR = "Jean Bourgain", TITLE = "Expanders and dimensional expansion ", journal = CRMath, year = "2009", doi="10.1016/j.crma.2009.02.009", volume=347, number="7--8", pages = "357--362" } @inproceedings{Pip82, author = {Pippenger, Nicholas}, title = {Advances in Pebbling (Preliminary Version)}, booktitle = {Proc. 9th Colloq. Autom. Lang. Program. (ICALP)}, year = {1982}, isbn = {3-540-11576-5}, pages = {407--417}, publisher = {Springer-Verlag}, address = {London, UK}, doi="10.1007/BFb0012787" } @inproceedings{PPST83, author = {Paul, Wolfgang J. and Pippenger, Nicholas and Szemer\'edi, Endre and Trotter, William T.}, title = {On determinism versus non-determinism and related problems}, booktitle = {Proc. 24th Ann. Symp. Found. Comput. Sci. (SFCS)}, year = {1983}, isbn = {0-8186-0508-1}, pages = {429--438}, doi = {10.1109/SFCS.1983.39}, publisher = ieee, address = {Washington, DC, USA}, } @inproceedings{BS84, author = {Buss, Jonathan F. and Shor, Peter W.}, title = {On the pagenumber of planar graphs}, booktitle = {Proc. 16th STOC}, year = {1984}, isbn = {0-89791-133-4}, pages = {98--100}, doi = {10.1145/800057.808670}, publisher = acm, address = {New York, NY, USA}, } @inproceedings{GKS86, author = {Galil, Zvi and Kannan, Ravi and Szemer\'edi, Endre}, title = {On nontrivial separators for k-page graphs and simulations by nondeterministic one-tape {T}uring machines}, booktitle = {Proc. 18th STOC}, year = {1986}, isbn = {0-89791-193-8}, pages = {39--49}, location = {Berkeley, California, United States}, doi = {10.1145/12130.12135}, publisher = acm, address = {New York, NY, USA}, } @inproceedings{San01, author = {Santhanam, Rahul}, title = {On Separators, Segregators and Time versus Space}, booktitle = {Proc. IEEE 16th Ann. Conf. Comput. Complex. (CCC)}, year = {2001}, pages = {286--294}, publisher = ieee, address = {Washington, DC, USA}, doi="10.1109/CCC.2001.933895" } @TECHREPORT{Bre08, AUTHOR = "Emmanuel Breuillard", TITLE = "A Strong {T}its Alternative", INSTITUTION = "ArXiv e-print repository", NUMBER = "arXiv:0804.1395", year = "2008", month = "April", eprint="arxiv:0804.1395v1" } @article{LT80, author = {Richard J. Lipton and Robert E. Tarjan}, title = {Applications of a Planar Separator Theorem}, journal = SIAMJComput, volume = {9}, number = {3}, year = {1980}, pages = {615--627}, bibsource = {DBLP, http://dblp.uni-trier.de}, doi="10.1137/0209046" } @inproceedings{AST90, author = {Alon, Noga and Seymour, Paul and Thomas, Robin}, title = {A separator theorem for graphs with an excluded minor and its applications}, booktitle = {Proc. 22nd STOC}, year = {1990}, isbn = {0-89791-361-2}, pages = {293--299}, location = {Baltimore, Maryland, United States}, doi = {10.1145/100216.100254}, publisher = acm, address = {New York, NY, USA}, } @article{Kla84, author = {Maria M. Klawe}, title = {Limitations on Explicit Constructions of Expanding Graphs}, journal = SIAMJComput, volume = {13}, number = {1}, year = {1984}, pages = {156--166}, bibsource = {DBLP, http://dblp.uni-trier.de}, doi="10.1137/0213011" } @ARTICLE{LZ08, author = "Alexander Lubotzky and Efim Zelmanov", title = "Dimension expanders", journal = JAlgebra, year = {2008}, volume = {319}, number = {2}, pages = {730--738}, doi="10.1016/j.jalgebra.2005.12.033" } @INPROCEEDINGS{LW93, AUTHOR = "Alexander Lubotzky and Benjamin Weiss", TITLE = "Groups and expanders", BOOKTITLE = "Expanding graphs (Princeton, NJ, 1992)", YEAR = "1993", series = "DIMACS Ser. 10", address = "Providence, RI", organization = "AMS", pages = "95--109" } @MISC{BISW, author = {Boaz Barak and Russell Impagliazzo and Amir Shpilka and Avi Wigderson}, title = {Definition and existence of dimension expanders}, note = {Discussion (no written record)}, year = {2004}, } @article{HPV77, author = {Hopcroft, John and Paul, Wolfgang and Valiant, Leslie G.}, title = {On Time Versus Space}, journal = JACM, volume = {24}, number = {2}, year = {1977}, issn = {0004-5411}, pages = {332--337}, doi = {10.1145/322003.322015}, publisher = acm, address = {New York, NY, USA}, } @inproceedings{AKS83, author = {Ajtai, Mikl\'os and Koml\'{o}s, J\'anos and Szemer\'{e}di, Endre}, title = {An ${O}(n \log n)$ sorting network}, booktitle = {Proc. 15th STOC}, year = {1983}, isbn = {0-89791-099-0}, pages = {1--9}, doi = {10.1145/800061.808726}, publisher = acm, address = {New York, NY, USA}, } @article{Ber79, title = "The book thickness of a graph", journal =JCombinTheorySerB, volume = "27", number= "3", pages = "320--331", year = "1979", issn ="0095-8956", doi = "10.1016/0095-8956(79)90021-2", author = "Frank Bernhart and Paul C. Kainen" } @article{CLR87, author = {Chung, Fan R. K. and Leighton, Frank Thomson and Rosenberg, Arnold L.}, title = {Embedding graphs in books: A layout problem with applications to {VLSI} design}, journal = SIAMJAlgDisMeth, volume = {8}, number = {1}, year = {1987}, issn = {0196-5212}, pages = {33--58}, doi = {10.1137/0608002}, publisher = {Society for Industrial and Applied Mathematics}, address = {Philadelphia, PA, USA}, } @MISC{Wig04, author = "Avi Wigderson", title = "Expanders: {O}ld and new applications and problems", howpublished="(A lecture at IPAM, UCLA)", year = "2004", month = "February" } @INPROCEEDINGS{DS07, AUTHOR = {Zeev Dvir and Amir Shpilka}, TITLE = {Towards dimension expanders over finite fields}, BOOKTITLE = {Proc. IEEE 23rd Ann. Conf. Comput. Complex. (CCC)}, YEAR = {2008}, ISBN = {978-0-7695-3169-4}, PAGES = {304--310}, DOI = {10.1109/CCC.2008.19}, PUBLISHER = ieee, ADDRESS = {Washington, DC, USA} } @article{LT79, author = {Richard J. Lipton and Robert E. Tarjan}, title = {A Separator Theorem for Planar Graphs}, publisher ={SIAM}, year = {1979}, journal = SIAMJApplMath, volume = {36}, number = {2}, pages = {177--189}, url = {http://link.aip.org/link/?SMM/36/177/1}, doi ={10.1137/0136016} } @Article{RSW93, author={Alexander Razborov and Endre Szemer\'edi and Avi Wigderson}, title={Constructing small sets that are uniform in arithmetic progressions}, journal=CombinProbabComput, volume={2}, pages={513--518}, year={1993}, doi="10.1017/S0963548300000870"} @ARTICLE{AIKPS90, AUTHOR = {Mikl\'os Ajtai and Henryk Iwaniec and J\'anos Koml\'os and J\'anos Pintz and Endre Szemer\'edi}, TITLE = {Construction of a Thin Set with Small {F}ourier Coefficients}, JOURNAL = BullLondMathSoc, YEAR = {1990}, volume = {22}, pages = {583--590}, doi="10.1112/blms/22.6.583" } @ARTICLE{Har08, AUTHOR = {Aram Harrow}, TITLE = {Quantum expanders from any classical {C}ayley graph expander}, JOURNAL = QuantumInfComput, YEAR={2008}, volume = {8}, number = {8/9}, pages = {715--721}, note = {\href{http://www.rintonpress.com/journals/qiconline.html\#v8n89}{QIC Volume 8}} } @ARTICLE{Mar88, AUTHOR = {G. A. Margulis}, TITLE = {Explicit group-theoretic constructions of combinatorial schemes and their applications in the construction of expanders and concentrators}, JOURNAL = ProblemyPeredachiInformatsii, YEAR={1988}, volume = {24}, number = {1}, pages = {51--60}, } @INPROCEEDINGS{FG03d, AUTHOR = {Gianni Franceschini and Viliam Geffert}, TITLE = {An In-Place Sorting with {$O(n\log n)$} Comparisons and {$O(n)$} Moves}, BOOKTITLE = {Proc. 44th FOCS}, PAGES = {242--250}, YEAR={2003}, publisher = ieee, doi="10.1109/SFCS.2003.1238198" } @ARTICLE{BG07, author = {Bourgain, Jean and Gamburd, Alex}, title = "{On the spectral gap for finitely-generated subgroups of $\textsf{SU}(2)$}", journal = InventMath, year ={2007}, month = {sep}, volume = {171}, pages = {83--121}, doi = {10.1007/s00222-007-0072-z} } %%%%%%%%%%%%%%%%%%%%%%%%%% %%%%% bib of v007a001 %%%%%%%%%%%%%%%%%%%%%%%%%% %% Theory of Computing %% File: v007a001.bib %% Publication date: February 15, 2011 %% Authors: Zeev Dvir and Amir Shpilka %% Theory of Computing %% File: v007a001.bib %% Publication date: January 25, 2011 %% Authors: Zeev Dvir and Amir Shpilka %% Edit history: DB 2011-1-9 LB 1-11 ACR 2-11 @comment{Journal of the ACM} @string{JACM="J. ACM"} @comment{Journal of Computer and System Sciences} @string{JComputSystemSci="J. Comput. System Sci."} @comment{Computational Complexity} @string{CompComplex="Comput. Complexity"} @comment{Electronic Colloquium on Computational Complexity (ECCC)} @string{eccc="Electron. Colloq. on Comput. Complexity (ECCC)"} @comment{SIAM Journal on Computing} @string{SIAMJComput="SIAM J. Comput."} @comment{Institute of Electrical and Electronics Engineers. Transactions on Information Theory} @string{IEEETransInformTheory="IEEE Trans. Inform. Theory"} @comment{Theory of Computing. An Open Access Journal} @string{TheoryComput="Theory of Computing"} @Article{ALMSS98, 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", year = "1998", volume = "45", number = "3", doi="10.1145/278298.278306" } @Article{AroraSafra98, title = "Probabilistic Checking of Proofs: {A} New Characterization of~{NP}", author = "Sanjeev Arora and Shmuel Safra", area = "Formal Languages and Complexity Theory", journal = JACM, pages = "70--122", year = "1998", volume = "45", number = "1", doi="10.1145/273865.273901" } @Article{BFNW93, author={L{\'a}szl{\'o} Babai and Lance Fortnow and Noam Nisan and Avi Wigderson}, title={{BPP} has subexponential time simulations unless {EXPTIME} has publishable proofs}, journal=CompComplex, volume={3}, number=4, pages={307--318}, year={1993}, doi="10.1007/BF01275486" } @article{Ben-SassonSudan10, author = {Eli Ben-Sasson and Madhu Sudan}, title = {Limits on the rate of locally testable affine-invariant codes}, journal = eccc, volume = {17}, year = {2010}, pages = {108}, ee = {http://eccc.hpi-web.de/report/2010/108}, bibsource = {DBLP, http://dblp.uni-trier.de}, eprint="eccc:TR10-108" } @inproceedings{Bogdanov05, author = {Andrej Bogdanov}, title = {Pseudorandom generators for low degree polynomials}, booktitle = {Proc. 37th STOC}, year = {2005}, pages = {21--30}, publisher="ACM Press", doi="10.1145/1060590.1060594" } @article{BogdanovViola10, author = {Andrej Bogdanov and Emanuele Viola}, title = {Pseudorandom Bits for Polynomials}, journal = SIAMJComput, volume = {39}, number = {6}, year = {2010}, pages = {2464--2486}, ee = {http://dx.doi.org/10.1137/070712109}, bibsource = {DBLP, http://dblp.uni-trier.de}, doi="10.1137/070712109" } @InProceedings{IW97, author={Russell Impagliazzo and Avi Wigderson}, title={{P=BPP} unless {E} has subexponential circuits: {Derandomizing} the {XOR} lemma}, booktitle={Proc. 29th STOC}, pages={220--229}, year={1997}, publisher="ACM Press", doi="10.1145/258533.258590" } @ARTICLE{Justesen72, author = {J. Justesen}, title = {A class of constructive asymptotically good algebraic codes}, journal = IEEETransInformTheory, year = {1972}, volume = {18}, number=5, pages = {652--656}, doi="10.1109/TIT.1972.1054893" } @article{Lovett09, author = {Shachar Lovett}, title = {Unconditional Pseudorandom Generators for Low Degree Polynomials}, journal = TheoryComput, volume = {5}, number = {1}, year = {2009}, pages = {69--82}, ee = {http://dx.doi.org/10.4086/toc.2009.v005a003}, bibsource = {DBLP, http://dblp.uni-trier.de}, doi="10.4086/toc.2009.v005a003" } @BOOK{MacWilliamsSloane, author="F. J. MacWilliams and N. J. A. Sloane", title="The {T}heory of {E}rror-{C}orrecting {C}odes, {P}art {II}", publisher="North-Holland", year="1977" } @article{ShaltielU05, author = {Ronen Shaltiel and Christopher Umans}, title = {Simple extractors for all min-entropies and a new pseudorandom generator.}, journal = JACM, volume = {52}, number = {2}, year = {2005}, pages = {172--216}, doi="10.1145/1059513.1059516" } @Article{SudanTV01, author = "Madhu Sudan and Luca Trevisan and Salil Vadhan", title = {Pseudorandom Generators without the {XOR} Lemma}, journal = JComputSystemSci, volume = {62}, number = {2}, year = {2001}, pages = {236--266}, bibsource = {DBLP, http://dblp.uni-trier.de}, doi="10.1006/jcss.2000.1730" } @article{Ta-ShmaZS06, author = {Amnon Ta-Shma and David Zuckerman and Shmuel Safra}, title = {Extractors from {R}eed-{M}uller codes}, journal = JComputSystemSci, volume = {72}, number = {5}, year = {2006}, pages = {786--812}, ee = {http://dx.doi.org/10.1016/j.jcss.2005.05.010}, bibsource = {DBLP, http://dblp.uni-trier.de}, doi="10.1016/j.jcss.2005.05.010" } @article{Viola09, author = {Emanuele Viola}, title = {The Sum of \emph{d} Small-Bias Generators Fools Polynomials of Degree \emph{d}}, journal = CompComplex, volume = {18}, number = {2}, year = {2009}, pages = {209--217}, doi="10.1007/s00037-009-0273-5" } %%%%%%%%%%%%%%%%%%%%%%%%%% %%%%% bib of v007a002 %%%%%%%%%%%%%%%%%%%%%%%%%% %% Theory of Computing %% File: v007a625.bib %% Publication date: March 15, 2011 %% Authors: Ashwin Nayak @comment{Journal of Computer and System Sciences} @string{JComputSystemSci="J. Comput. System Sci."} @comment{SIAM Journal on Computing} @string{SIAMJComput="SIAM J. Comput."} @Book{KayeLM07, author = "Phillip Kaye and Raymond Laflamme and Michele Mosca", title = "An Introduction to Quantum Computing", publisher = "Oxford University Press", address = "New York, NY, USA", year = "2007" } @InProceedings{Grover96, title = "A Fast Quantum Mechanical Algorithm for Database Search", author = "Lov K. Grover", pages = "212--219", booktitle = "Proc. 28th STOC", year = "1996", publisher = "ACM Press", doi ="10.1145/237814.237866" } @article{BennettBBV97, Author = {Charles H. Bennett and Ethan Bernstein and Gilles Brassard and Umesh Vazirani}, Title = {Strengths and Weaknesses of Quantum Computing}, Journal = SIAMJComput, Volume = {26}, number = {5}, Pages = {1510--1523}, Year = {1997}, note = {}, doi ="10.1137/S0097539796300933" } @article{Ambainis02, Author = {Andris Ambainis}, Title = {Quantum Lower Bounds by Quantum Arguments}, Journal = JComputSystemSci, Volume = {64}, number = {4}, Pages = {750--767}, Year = {2002}, note = {}, doi ="10.1006/jcss.2002.1826" } %%%%%%%%%%%%%%%%%%%%%%%%%% %%%%% bib of v007a003 %%%%%%%%%%%%%%%%%%%%%%%%%% %% Theory of Computing %% File: v007a528.bib %% Publication date: March 20, 2011 %% Authors: Per Austrin, Subhash Khot, and Muli Safra %% Theory of Computing %% File: v007a528.bib %% Publication date: March 20, 2011 %% Authors: Per Austrin, Subhash Khot, and Muli Safra @comment{SIAM Journal on Computing} @string{SIAMJComput="SIAM J. Comput."} @comment{SIAM Journal on Discrete Mathematics} @string{SIAMJDiscreteMath="SIAM J. Discrete Math."} @comment{Journal of Computer and System Sciences} @string{JComputSystemSci="J. Comput. System Sci."} @comment{Annals of Mathematics} @string{AnnofMath="Ann. of Math."} @comment{Acta Mathematica} @string{ActaMath="Acta Math."} @comment{Journal of Combinatorial Optimization} @string{JCombOptim="J. Comb. Optim."} @comment{Lecture Notes in Computer Science} @string{LectureNotesinComputSci="Lecture Notes in Comput. Sci."} @Article{ halperin02improved, author = "Eran Halperin", title = "Improved Approximation Algorithms for the Vertex Cover Problem in Graphs and Hypergraphs", journal = SIAMJComput, volume = "31", number = "5", year = "2002", pages = "1608--1623", bibsource = "DBLP, http://dblp.uni-trier.de", doi="10.1137/S0097539700381097" } @InProceedings{ samorodnitsky06gowers, author = "Alex Samorodnitsky and Luca Trevisan", title = "{Gowers} Uniformity, Influence of Variables, and {PCPs}", booktitle = "Proc. 38th STOC", year = "2006", isbn = "1-59593-134-1", pages = "11--20", location = "Seattle, WA, USA", doi = "10.1145/1132516.1132519", publisher="ACM Press" } @InProceedings{ karakostas05better, author = "George Karakostas", title = "A Better Approximation Ratio for the Vertex Cover Problem", booktitle = "Proc. 32nd Intern. Colloq. Autom. Lang. Program. (ICALP)", series=LectureNotesinComputSci, number=3580, publisher="Springer", year = "2005", pages = "1043--1050", ee = "http://dx.doi.org/10.1007/11523468\_84", doi="10.1007/11523468\_84" } @Article{ khot08vertex, author = "Subhash Khot and Oded Regev", title = "Vertex Cover Might be Hard to Approximate to Within {$2-\epsilon$}", journal = JComputSystemSci, volume = "74", number = "3", year = "2008", pages = "335--349", doi="10.1016/j.jcss.2007.06.019" } @Article{ dinur05hardness, author = "Dinur, Irit and Safra, Shmuel", title = "On the Hardness of Approximating Minimum Vertex Cover", journal = AnnofMath, volume = "162", number = "1", pages = "439--485", year = "2005", doi="10.4007/annals.2005.162.439" } @InProceedings{ halldorsson99approximations, author = "Magn{\'u}s M. Halld{\'o}rsson", title = "Approximations of Weighted Independent Set and Hereditary Subset Problems", booktitle = "Proc. 5th Ann. Intern. Conf. Comput. Combin. (COCOON)", year = "1999", pages = "261--270", ee = "http://link.springer.de/link/service/series/0558/bibs/1627/16270261.htm" , bibsource = "DBLP, http://dblp.uni-trier.de", doi="10.1007/3-540-48686-0\_26", series=LectureNotesinComputSci, volume=1627, publisher="Springer" } @InProceedings{ samorodnitsky00pcp, author = "Alex Samorodnitsky and Luca Trevisan", title = "A {PCP} characterization of {NP} with optimal amortized query complexity", booktitle = "Proc. 32nd STOC", year = "2000", pages = "191--199", publisher="ACM Press", doi="10.1145/335305.335329" } @Article{ feige04approximating, author = "Uriel Feige", title = "Approximating Maximum Clique by Removing Subgraphs", journal = SIAMJDiscreteMath, volume = "18", number = "2", year = "2004", pages = "219--225", doi="10.1137/S089548010240415X" } @Article{ hastad99clique, author = "Johan H{\aa}stad", title = "Clique is hard to approximate within {$n^{1-\epsilon}$}", journal = ActaMath, volume = "48", number = "4", pages = "105--142", year = "1999", doi="10.1007/BF02392825" } @InProceedings{ khot06better, author = "Subhash Khot and Ashok Kumar Ponnuswami", title = "Better Inapproximability Results for MaxClique, Chromatic Number and {Min-3Lin-Deletion}", booktitle = "Proc. 33rd Intern. Colloq. Autom. Lang. Program. (ICALP)", series=LectureNotesinComputSci, number=4051, publisher="Springer", year = "2006", pages = "226--237", ee = "http://dx.doi.org/10.1007/11786986\_21", bibsource = "DBLP, http://dblp.uni-trier.de", doi="10.1007/11786986\_21" } @Article{ dinur09conditional, author = "Irit Dinur and Elchanan Mossel and Oded Regev", title = "Conditional Hardness for Approximate Coloring", journal = SIAMJComput, volume = "39", number = "3", year = "2009", pages = "843--873", ee = "http://dx.doi.org/10.1137/07068062X", bibsource = "DBLP, http://dblp.uni-trier.de", doi="10.1137/07068062X" } @Article{ mossel10noise, author = "Elchanan Mossel and Ryan O'Donnell and Krzysztof Oleszkiewicz", title = "Noise Stability of Functions With Low Influences: {Invariance} and Optimality", journal = AnnofMath, volume = "171", number = "1", pages = "295--341", year = "2010", doi="10.4007/annals.2010.171.295" } @InProceedings{ khot02power, author = "Subhash Khot", title = "On the Power of Unique 2-prover 1-round Games", booktitle = "Proc. 34th STOC", year = "2002", isbn = "1-58113-495-9", pages = "767--775", location = "Montreal, Quebec, Canada", doi = "10.1145/509907.510017", publisher="ACM Press" } @InProceedings{ guruswami08beating, author = "Venkatesan Guruswami and Rajsekar Manokaran and Prasad Raghavendra", title = "Beating the Random Ordering is Hard: {Inapproximability} of Maximum Acyclic Subgraph", booktitle = "Proc. 49th FOCS", year = "2008", pages = "573--582", ee = "http://dx.doi.org/10.1109/FOCS.2008.51", doi="10.1109/FOCS.2008.51", publisher="IEEE Comp. Soc. Press", bibsource = "DBLP, http://dblp.uni-trier.de" } @InProceedings{ austrin07balanced, author = "Per Austrin", title = "Balanced {Max 2-Sat} Might Not be the Hardest", booktitle = "Proc. 39th STOC", year = "2007", pages = "189--197", ee = "http://doi.acm.org/10.1145/1250790.1250818", note = "Full version available as ECCC Report TR06-088", doi="10.1145/1250790.1250818", publisher="ACM Press" } @Article{ deklerk04approximate, author = "Etienne de Klerk and Dmitrii V. Pasechnik and Joost P. Warners", title = "On Approximate Graph Colouring and {MAX-$k$-CUT} Algorithms Based on the {$\vartheta$}-Function", journal = JCombOptim, volume = "8", number = "3", year = "2004", pages = "267--294", bibsource = "DBLP, http://dblp.uni-trier.de", doi="10.1023/B:JOCO.0000038911.67280.3f" } @Article{ khot07optimal, author = "Subhash Khot and Guy Kindler and Elchanan Mossel and Ryan O'Donnell", title = "Optimal Inapproximability Results for {MAX-CUT} and Other 2-variable {CSPs}?", year = "2007", journal = SIAMJComput, volume = "37", number = "1", pages = "319--357", doi="10.1137/S0097539705447372" } @InProceedings{ mossel08gaussian, author = "Elchanan Mossel", title = "Gaussian Bounds for Noise Correlation of Functions and Tight Analysis of Long Codes", year = "2008", booktitle = "Proc. 49th FOCS", pages = "156--165", doi="10.1109/FOCS.2008.44", publisher="IEEE Comp. Soc. Press" } @InProceedings{ bansal09optimal, author = "Nikhil Bansal and Subhash Khot", title = "Optimal Long Code Test with One Free Bit", booktitle = "Proc. 50th FOCS", year = "2009", pages = "453--462", ee = "http://doi.ieeecomputersociety.org/10.1109/FOCS.2009.23", bibsource = "DBLP, http://dblp.uni-trier.de", doi="10.1109/FOCS.2009.23", publisher="IEEE Comp. Soc. Press" } @InProceedings{ bansal10inapproximability, author = "Nikhil Bansal and Subhash Khot", title = "Inapproximability of Hypergraph Vertex Cover and Applications to Scheduling Problems", booktitle = "Proc. 37th Intern. Colloq. Autom. Lang. Program. (ICALP)", series=LectureNotesinComputSci, number=6198, publisher="Springer", year = "2010", pages = "250--261", ee = "http://dx.doi.org/10.1007/978-3-642-14165-2\_22", bibsource = "DBLP, http://dblp.uni-trier.de", doi="10.1007/978-3-642-14165-2\_22", } @Misc{ kumar09optimality, author = "Amit Kumar and Rajsekar Manokaran and Madhur Tulsiani and Nisheeth K. Vishnoi", title = "On the Optimality of a Class of {LP}-based Algorithms", eprint = "arXiv:0912.1776v1", year = "2009" } %%%%%%%%%%%%%%%%%%%%%%%%%% %%%%% bib of v007a004 %%%%%%%%%%%%%%%%%%%%%%%%%% %% Theory of Computing %% File: v007a653.bib %% Publication date: April 5, 2011 %% Authors: Kazuyuki Amano @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."} @article{Bop97, author = "Ravi B. Boppana", title = "The average sensitivity of bounded-depth circuits", journal = ipl, volume = 63, number = 5, pages = "257--261", year = 1997, doi = "10.1016/S0020-0190(97)00131-2" } @book{Wol08, author = "Ronald de Wolf", title = "A Brief Introduction to {Fourier} Analysis on the {Boolean} Cube", year = 2008, pages = "1--20", doi = "10.4086/toc.gs.2008.001", publisher ="Theory of Computing Library", series ="Graduate Surveys", number = "1", url = "http://www.theoryofcomputing.org/library.html", } @article{Lin93, author = "Nathan Linial and Yishay Mansour and Noam Nisan", title = "Constant depth circuits, {Fourier} transform and learnability", journal = jacm, volume = 40, number = 3, pages = "607--620", year = 1993, doi = "10.1145/174130.174138", } @inproceedings{Odo08, author = "Ryan O'Donnell", title = "Some Topics in Analysis of {Boolean} functions", booktitle = {Proc. 40th STOC}, year = 2008, publisher = "ACM Press", pages = "569--578", doi = "10.1145/1374376.1374458" } @article{PPZ99, author = "Ramamohan Paturi and Pavel Pudl\'{a}k and Francis Zane", title = "Satisfiability coding lemma", journal = "Chicago Journal of Theoretical Computer Science", volume = 1999, number = 115, year = 1999, pages = "1--18", note = "(Conference version in FOCS '97, pp. 566--574, 1997)", doi = "10.4086/cjtcs.1999.011" } @inproceedings{Tra09, author = "Patrick Traxler", title = "Variable influences in conjunctive normal forms", booktitle = "Proc. 12th Internat. Conf. on Theory and Appl. of Satisfiability (SAT'09), volume 5584 of LNCS", year = 2009, publisher = "Springer", pages = "101--113", doi = "10.1007/978-3-642-02777-2\_12" } @article{CIKP08, author = "Chris Calabro and Russell Impagliazzo and Valentine Kabanets and Ramamohan Paturi", title = "The complexity of unique {$k$-SAT}: {An} isolation lemma for {$k$-CNF}s", journal = jcss, volume = 74, number = 3, year = 2008, pages = "386--393", doi = "10.1016/j.jcss.2007.06.015", note = "(Conference version in CCC '03, pp. 135--141, 2003)", } @article{Fri98, author = "Ehud Friedgut", title = "{Boolean} functions with low average sensitivity depend on few coordinates", journal = comba, year = 1998, volume = 18, number = 1, pages = "27--35", doi = "10.1007/PL00009809", } @misc{ODo07, author = "Ryan O'Donnell", title = "The lecture notes of the course ``Analysis of {Boolean} {Functions}'': {Lecture} 29: {Open} problems", year = 2007, howpublished = "\url{http://www.cs.cmu.edu/~odonnell/boolean-analysis/lecture29.pdf}" } %%%%%%%%%%%%%%%%%%%%%%%%%% %%%%% bib of v007a005 %%%%%%%%%%%%%%%%%%%%%%%%%% %% Theory of Computing %% File: v007a005.bib %% Publication date: March 22, 2011 %% Authors: Robert Krauthgamer and Tim Roughgarden %% Theory of Computing %% File: v007a550.bib %% Publication date: March 22, 2011 %% Authors: Robert Krauthgamer and Tim Roughgarden %% revised LB 2011-03-10 %% Theory of Computing %% File: v007a550.bib %% Publication date: March 22, 2011 %% Authors: Robert Krauthgamer and Tim Roughgarden @comment{SIAM Journal on Computing} @string{SIAMJComput="SIAM J. Comput."} @comment{Combinatorica. An International Journal on Combinatorics and the Theory of Computing} @string{Combinatorica="Combinatorica"} @comment{Geometric and Functional Analysis} @string{GeomFunctAnal="Geom. Funct. Anal."} @comment{Journal of Computer and System Sciences} @string{JComputSystemSci="J. Comput. System Sci."} @comment{Journal of the ACM} @string{JACM="J. ACM"} @comment{Lecture Notes in Computer Science} @string{LectureNotesinComputSci="Lecture Notes in Comput. Sci."} @comment{Computational Complexity} @string{CompComplex="Comput. Complexity"} @comment{International Mathematics Research Notices} @string{IntMathResNot="Int. Math. Res. Not."} @comment{Distributed Computing} @string{DistribComput="Distrib. Comput."} @comment{Comptes Rendus de l'Academie des Sciences. Serie I. Mathematique} @string{CRMath="C. R. Acad. Sci. Paris Ser. I Math."} @string{ACMPUB="ACM Press"} @string{IEEEPUB="IEEE Comp. Soc. Press"} @Misc{ bkprivate, author = "Yair Bartal and Robert Krauthgamer", title = "Unpublished", year = "2007" } @Article{ d+94, author = "Elias Dahlhaus and David S. Johnson and Christos H. Papadimitriou and Paul D. Seymour and Mihalis Yannakakis", title = "The Complexity of Multiterminal Cuts", journal = SIAMJComput, fjournal = "SIAM Journal on Computing", volume = "23", year = "1994", number = "4", pages = "864--894", doi="10.1137/S0097539792225297" } @InProceedings{ kr08, title = "Metric Clustering via Consistent Labeling", author = "Robert Krauthgamer and Tim Roughgarden", booktitle = "Proc. 19th Ann. ACM-SIAM Symp. Discrete Algorithms (SODA'08)", year = "2008", pages = "809--818" } @Article{ llr95, author = "Linial, Nathan and London, Eran and Rabinovich, Yuri", title = "The geometry of graphs and some of its algorithmic applications", journal = Combinatorica, volume = "15", year = "1995", number = "2", pages = "215--245", doi="10.1007/BF01200757" } @InProceedings{ bis07, author = "B\v{a}doiu, Mihai and Indyk, Piotr and Sidiropoulos, Anastasios", title = "Approximation algorithms for embedding general metrics into trees", booktitle = "Proc. 18th Ann. ACM-SIAM Symp. Discrete Algorithms (SODA'07)", year = "2007", isbn = "978-0-898716-24-5", pages = "512--521", url = "http://portal.acm.org/citation.cfm?id=1283383.1283438", publisher = "Society for Industrial and Applied Mathematics" } @InProceedings{ ms08, title = "Inapproximability for Metric Embeddings into {$R^d$}", author = "Matou{\v s}ek, Ji{\v r}{\'\i} and Sidiropoulos, Anastasios", booktitle = "Proc. 49th FOCS", year = "2008", publisher = IEEEPUB, pages = "405--413", doi="10.1109/FOCS.2008.21" } @InProceedings{ kpr93, title = "Excluded Minors, Network Decomposition, and Multicommodity Flow", author = "Philip N. Klein and Serge A. Plotkin and Satish Rao", pages = "682--690", booktitle = "Proc. 25th STOC", publisher = ACMPUB, year = "1993", month = may, doi="10.1145/167088.167261" } @InProceedings{ rao99, author = "Rao, Satish", title = "Small distortion and volume preserving embeddings for planar and {E}uclidean metrics", booktitle = "Proc. 15th Ann. Symp. Comput. Geom. (SoCG `99)", pages = "300--306", publisher = ACMPUB, year = "1999", doi="10.1145/304893.304983" } @InProceedings{ ft03, title = "Improved decompositions of graphs with forbidden minors", author = "Jittat Fakcharoenphol and Kunal Talwar", booktitle = "Proc. 6th Intern. Workshop Approx. Algorithms for Comb. Opt. (APPROX '03)", publisher = "Springer", series = LectureNotesinComputSci, volume = "2764", pages = "871--882", year = "2003", doi="10.1007/978-3-540-45198-3\_4" } @Article{ klmn05, title = "Measured descent: {A} new embedding method for finite metrics", author = "Robert Krauthgamer and James R. Lee and Manor Mendel and Assaf Naor", journal = GeomFunctAnal, volume = "15", number = "4", year = "2005", pages = "839--858", doi="10.1007/s00039-005-0527-6" } @InProceedings{ ls10, author = "James R. Lee and Anastasios Sidiropoulos", title = "Genus and the Geometry of the Cut Graph", year = "2010", pages = "193--201", ee = "http://www.siam.org/proceedings/soda/2010/SODA10\_018\_leej.pdf" , booktitle = "Proc. 20th Ann. ACM-SIAM Symp. Discrete Algorithms (SODA `10)", publisher = "SIAM" } @InProceedings{ ccggp98, author = "Moses Charikar and Chandra Chekuri and Ashish Goel and Sudipto Guha and Serge Plotkin", title = "Approximating a finite metric by a small number of tree metrics", booktitle = "Proc. 39th FOCS", publisher = IEEEPUB, pages = "379--388", year = "1998", doi="10.1109/SFCS.1998.743488" } @InCollection{ bartal96, author = "Bartal, Yair", title = "Probabilistic approximation of metric spaces and its algorithmic applications", booktitle = "Proc. 37th FOCS", pages = "184--193", publisher = IEEEPUB, year = "1996", doi="10.1109/SFCS.1996.548477" } @InProceedings{ ap90, title = "Sparse partitions", author = "Baruch Awerbuch and David Peleg", pages = "503--513", booktitle = "Proc. 31st FOCS", publisher = IEEEPUB, year = "1990", doi="10.1109/FSCS.1990.89571" } @Article{ frt04, author = "Jittat Fakcharoenphol and Satish Rao and Kunal Talwar", title = "A tight bound on approximating arbitrary metrics by tree metrics.", journal = JComputSystemSci, volume = "69", number = "3", year = "2004", pages = "485--497", ee = "http://dx.doi.org/10.1016/j.jcss.2004.04.011", doi="10.1016/j.jcss.2004.04.011", bibsource = "DBLP, http://dblp.uni-trier.de" } @InProceedings{ lr88, title = "An Approximate Max-Flow Min-Cut Theorem for Uniform Multicommodity Flow Problems with Applications to Approximation Algorithms", author = "Frank Thomson Leighton and Satish Rao", pages = "422--431", booktitle = "Proc. 29th FOCS", publisher = IEEEPUB, year = "1988", doi="10.1109/SFCS.1988.21958" } @Article{ ls93, author = "Linial, Nathan and Saks, Michael", title = "Low diameter graph decompositions", journal = Combinatorica, volume = "13", year = "1993", number = "4", pages = "441--454", doi="10.1007/BF01303516" } @Article{ gvy96, author = "Garg, Naveen and Vazirani, Vijay V. and Yannakakis, Mihalis", title = "Approximate max-flow min-(multi)cut theorems and their applications", journal = SIAMJComput, volume = "25", year = "1996", number = "2", pages = "235--251", doi="10.1137/S0097539793243016" } @InProceedings{ gkl03, title = "Bounded geometries, fractals, and low-distortion embeddings", author = "Anupam Gupta and Robert Krauthgamer and James R. Lee", booktitle = "Proc. 44th FOCS", publisher = IEEEPUB, pages = "534--543", year = "2003", doi="10.1109/SFCS.2003.1238226" } @InProceedings{ kl06, author = "Robert Krauthgamer and James R. Lee", title = "Algorithms on negatively curved spaces", year = "2006", pages = "119--132", ee = "http://doi.ieeecomputersociety.org/10.1109/FOCS.2006.9", doi="10.1109/FOCS.2006.9", booktitle = "Proc. 47th FOCS", publisher = IEEEPUB } @Unpublished{ ln03draft, author = "James R. Lee and Assaf Naor", title = "Metric decomposition, smooth measures, and clustering", year = "2004", note = "Manuscript, available at \url{http://www.cims.nyu.edu/~naor/homepage\%20files/cluster.pdf}" , url = "http://www.cims.nyu.edu/~naor/homepage\%20files/cluster.pdf" } @Article{ assouad82, author = "Patrice Assouad", title = "Sur la distance de {N}agata", journal = CRMath, number = "294", volume = "1", pages = "31--34", year = "1982" } @InProceedings{ gs95, author = "Guyton, James D. and Schwartz, Michael F.", title = "Locating nearby copies of replicated Internet servers", booktitle = "Proc. Conf. Appl., Technol., Architectures, and Protocols for Comput. Commun. (SIGCOMM '95)", year = "1995", isbn = "0-89791-711-1", pages = "288--298", doi = "10.1145/217382.217463", publisher = ACMPUB, address = "New York, NY, USA" } @Article{ ksw09, author = "Jon M. Kleinberg and Aleksandrs Slivkins and Tom Wexler", title = "Triangulation and embedding using small sets of beacons", journal = JACM, volume = "56", number = "6", year = "2009", issn = "0004-5411", pages = "1--37", doi = "10.1145/1568318.1568322", publisher = ACMPUB, note = "Earlier version in FOCS '04, pp. 444--453" } @InProceedings{ krauthgamer07, author = "Robert Krauthgamer", title = "On triangulation of simple networks", year = "2007", pages = "8--15", booktitle = "Proc. 19th Ann. ACM Symp. Parallel Algorithms and Architectures (SPAA'07)", publisher = ACMPUB, doi="10.1145/1248377.1248380" } @Article{ kt02, author = "Jon M. Kleinberg and {\'E}va Tardos", title = "Approximation algorithms for classification problems with pairwise relationships: {Metric} labeling and {M}arkov random fields", journal = JACM, volume = 49, number = 5, year = 2002, issn = "0004-5411", pages = "616--639", doi = "10.1145/585265.585268", publisher = ACMPUB, } @Article{ ckr00, author = "Gruia Calinescu and Howard J. Karloff and Yuval Rabani", title = "An Improved Approximation Algorithm for {{\textsc{Multiway Cut}}}", journal = JComputSystemSci, volume = "60", number = "3", year = "2000", pages = "564--574", doi="10.1006/jcss.1999.1687" } @InProceedings{ slivkins05, author = "Aleksandrs Slivkins", title = "Distributed approaches to triangulation and embedding", booktitle = "Proc. 16th Ann. ACM-SIAM Symp. Discrete Algorithms (SODA'05)", year = "2005", pages = "640--649" } @InProceedings{ lrs06, author = "Michael Langberg and Yuval Rabani and Chaitanya Swamy", title = "Approximation Algorithms for Graph Homomorphism Problems", year = "2006", pages = "176--187", ee = "http://dx.doi.org/10.1007/11830924\_18", doi="10.1007/11830924\_18", booktitle = "Proc. 9th Intern.. Workshop Approx. Algorithms for Comb. Opt. (APRROX '06)", publisher = "Springer", series = LectureNotesinComputSci, volume = "4110" } @Book{ mr95, author = "Rajeev Motwani and Prabhakar Raghavan", title = "Randomized Algorithms", publisher = "Cambridge University Press", year = "1995" } @Article{ ly94, author = "Carsten Lund and Mihalis Yannakakis", title = "On the hardness of approximating minimization problems", journal = JACM, volume = "41", year = "1994", number = "5", pages = "960--981", doi="10.1145/185675.306789" } @Article{ feige98, author = "Feige, Uriel", title = "A threshold of $\ln n$ for approximating set cover", journal = JACM, volume = "45", year = "1998", number = "4", pages = "634--652", issn = "0004-5411", mrclass = "68Q17 (05C70)", mrnumber = "2000f:68049", mrreviewer = "Uwe Sch{\"o}ning", doi="10.1145/285055.285059" } @InCollection{ rs97, author = "Ran Raz and Shmuel Safra", title = "A sub-constant error-probability low-degree test, and a sub-constant error-probability {PCP} characterization of {NP}", booktitle = "Proc. 29th STOC", pages = "475--484", publisher = ACMPUB, year = "1997", doi="10.1145/258533.258641" } @Article{ hss06, author = "Elad Hazan and Shmuel Safra and Oded Schwartz", title = "On the complexity of approximating {$k$-set} packing", journal = CompComplex, volume = "15", number = "1", year = "2006", issn = "1016-3328", pages = "20--39", doi = "10.1007/s00037-006-0205-6", publisher = "Birkh{\"a}user Verlag" } @Article{ arv09, author = "Sanjeev Arora and Satish Rao and Umesh V. Vazirani", title = "Expander flows, geometric embeddings and graph partitioning", journal = JACM, volume = "56", number = "2", year = "2009", issn = "0004-5411", pages = "1--37", doi = "10.1145/1502793.1502794", publisher = ACMPUB } @Article{ ls05, author = "Urs Lang and Thilo Schlichenmaier", title = "Nagata dimension, quasisymmetric embeddings, and {Lipschitz} extensions", journal = IntMathResNot, year = "2005", volume = "2005", number = "58", pages = "3625--3655", doi = "10.1155/IMRN.2005.3625" } @Article{ slivkins07, author = "Aleksandrs Slivkins", title = "Distance estimation and object location via rings of neighbors", journal = DistribComput, volume = "19", number = "4", year = "2007", pages = "313--333", note = "Earlier version in PODC '05, pp. 41--50", doi = "10.1007/s00446-006-0015-8" } @Article{ krs09, author = "Claire Kenyon and Yuval Rabani and Alistair Sinclair", title = "Low Distortion Maps Between Point Sets", journal = SIAMJComput, volume = "39", number = "4", year = "2009", pages = "1617--1636", doi = "10.1137/080712921" } %%%%%%%%%%%%%%%%%%%%%%%%%% %%%%% bib of v007a006 %%%%%%%%%%%%%%%%%%%%%%%%%% %% Theory of Computing %% File: v007a006.bib %% Publication date: March 31, 2011 %% Authors: Arnab Bhattacharyya, Victor Chen, Madhu Sudan, and Ning Xie %% Theory of Computing %% File: v007a522.bib %% Publication date: March 31, 2011 %% Authors: Arnab Bhattacharyya, Victor Chen, Madhu Sudan, and Ning Xie @comment{Journal of the ACM} @string{JACM="J. ACM"} @comment{SIAM Journal on Computing} @string{SIAMJComput="SIAM J. Comput."} @comment{Electronic Colloquium on Computational Complexity (ECCC)} @string{eccc="Electron. Colloq. on Comput. Complexity (ECCC)"} @comment{Computational Complexity} @string{CompComplex="Comput. Complexity"} @comment{Journal of Computer and System Sciences} @string{JComputSystemSci="J. Comput. System Sci."} @comment{Institute of Electrical and Electronics Engineers. Transactions on Information Theory} @string{IEEETransInformTheory="IEEE Trans. Inform. Theory"} @comment{Geometric and Functional Analysis} @string{GeomFunctAnal="Geom. Funct. Anal."} @comment{Annals of Mathematics.} @string{AnnofMath="Ann. of Math."} @comment{Journal of Combinatorial Theory. Series A} @string{JCombinTheorySerA="J. Combin. Theory Ser. A"} @comment{SIAM Journal on Discrete Mathematics} @string{SIAMJDiscreteMath="SIAM J. Discrete Math."} @comment{Transactions of the American Mathematical Society} @string{TransAmerMathSoc="Trans. Amer. Math. Soc."} @string{ACMPUB="ACM Press"} @string{IEEEPUB="IEEE Comp. Soc. Press"} @Article{ almss, author = "Sanjeev Arora and Carsten Lund and Rajeev Motwani and Madhu Sudan and Mario Szegedy", title = "Proof verification and the hardness of approximation problems", journal = JACM, volume = "45", number = "3", year = "1998", issn = "0004-5411", pages = "501--555", doi = "10.1145/278298.278306", } @InProceedings{ alonshapira1, author = "Noga Alon and Asaf Shapira", title = "Every monotone graph property is testable", booktitle = "Proc. 37th STOC", publisher=ACMPUB, year = "2005", pages = "128--137", ee = "http://doi.acm.org/10.1145/1060590.1060611", doi="10.1145/1060590.1060611", bibsource = "DBLP, http://dblp.uni-trier.de" } @InProceedings{ alonshapira2, author = "Noga Alon and Asaf Shapira", title = "A Characterization of the (natural) Graph Properties Testable with One-Sided Error", booktitle = "Proc. 46th FOCS", year = "2005", pages = "429--438", ee = "http://doi.ieeecomputersociety.org/10.1109/SFCS.2005.5", doi="10.1109/SFCS.2005.5", publisher = IEEEPUB, bibsource = "DBLP, http://dblp.uni-trier.de" } @Article{ akns, author = "Noga Alon and Michael Krivelevich and Ilan Newman and Mario Szegedy", title = "Regular Languages are Testable with a Constant Number of Queries", journal = SIAMJComput, volume = "30", number = "6", year = "2000", pages = "1842--1862", ee = "http://epubs.siam.org/sam-bin/dbq/article/36652", bibsource = "DBLP, http://dblp.uni-trier.de", doi="10.1137/S0097539700366528" } @TechReport{ alonshapirasurvey, author = "Noga Alon and Asaf Shapira", title = "Homomorphisms in Graph Property Testing - A Survey", institution = eccc, number = 085, year = 2005, ee = "http://eccc.hpi-web.de/eccc-reports/2005/TR05-085/index.html", eprint = {eccc:TR05-085}, } @InProceedings{ akklr, author = "Noga Alon and Tali Kaufman and Michael Krivelevich and Simon Litsyn and Dana Ron", title = "Testing low-degree polynomials over {GF(2)}", booktitle = "Proc. Approx. Random. Comb. Opt. (RANDOM '03)", series = "Lecture Notes in Computer Science", volume = 2764, publisher = "Springer", year = "2003", pages = "188--199", url = "citeseer.ist.psu.edu/article/alon03testing.html", doi="10.1007/978-3-540-45198-3\_17" } @Article{ afns, author = "Noga Alon and Eldar Fischer and Ilan Newman and Asaf Shapira", title = "A combinatorial characterization of the testable graph properties: It's all about regularity", journal=SIAMJComput, volume=39, year=2009, pages="143--167", doi="10.1137/060667177" } @Article{ arosaf, author = "Sanjeev Arora and Shmuel Safra", title = "Probabilistic checking of proofs: {A} new characterization of {NP}", journal = JACM, volume = "45", number = "1", year = "1998", issn = "0004-5411", pages = "70--122", doi = "10.1145/273865.273901", } @TechReport{ bcsx10, author = "Arnab Bhattacharyya and Victor Chen and Madhu Sudan and Ning Xie", title = "Testing linear-invariant non-linear properties: A short report", institution = eccc, month = "July", year = "2010", number = "10-116", eprint = "eccc:TR10-116" } @Article{ belgolsud98, author = "Mihir Bellare and Oded Goldreich and Madhu Sudan", title = "Free Bits, {PCP}s, and Nonapproximability---Towards Tight Results", journal = SIAMJComput, volume = "27", number = "3", year = "1998", issn = "0097-5397", pages = "804--915", doi = "10.1137/S0097539796302531", } @InProceedings{ bgs10, author = "Arnab Bhattacharyya and Elena Grigorescu and Asaf Shapira", title = "A Unified Framework for Testing Linear-Invariant Properties", booktitle = "Proc. 51st FOCS", publisher=IEEEPUB, year = "2010", pages = "478--487", doi="10.1109/FOCS.2010.53" } @Article{ bfl, author = "L{\'a}szl{\'o} Babai and Lance Fortnow and Carsten Lund", title = "Non-Deterministic Exponential Time has Two-Prover Interactive Protocols", journal = CompComplex, volume = "1", number = "1", pages = "3--40", year = "1991", doi="10.1007/BF01200430" } @Article{ blr, author = "Manuel Blum and Michael Luby and Ronitt Rubinfeld", title = "Self-Testing/Correcting with Applications to Numerical Problems", journal = JComputSystemSci, volume = "47", number = "3", pages = "549--595", year = "1993", url = "citeseer.ist.psu.edu/article/blum90selftestingcorrecting.html", doi="10.1016/0022-0000(93)90044-W" } @Article{ bchks, author = "Mihir Bellare and Don Coppersmith and Johan H{\r{a}}stad and Marcos A. Kiwi and Madhu Sudan", title = "Linearity testing over characteristic two", journal = IEEETransInformTheory, volume = "42", number=6, year = "1996", pages = "1781--1795", doi="10.1109/18.556674" } @InProceedings{ bclssv, author = "Christian Borgs and Jennifer T. Chayes and L{\'a}szl{\'o} Lov{\'a}sz and Vera T. S{\'o}s and Bal{\'a}zs Szegedy and Katalin Vesztergombi", title = "Graph limits and parameter testing", booktitle = "Proc. 38th STOC", publisher=ACMPUB, year = "2006", pages = "261--270", doi="10.1145/1132516.1132556" } @TechReport{ bgnx10, author = {Arnab Bhattacharyya and Elena Grigorescu and Jakob Nordstr\"om and Ning Xie}, title = "Separations of Matroid Freeness Properties", institution = eccc, month = "August", year = "2010", number = "10-136", eprint = {eccc:TR10-136} } @Article{ btz10, author = "Vitaly Bergelson and Terence Tao and Tamar Ziegler", title = "An inverse theorem for the uniformity seminorms associated with the action of {$\mathbb{F}^{\omega}$}", journal = GeomFunctAnal, volume = "19", pages = "1539--1596", year = "2010", doi="10.1007/s00039-010-0051-1" } @InProceedings{ csx11, author = "Victor Chen and Madhu Sudan and Ning Xie", title = "Property Testing via Set-Theoretic Operations", booktitle = "Proc. 2nd Symp. Innov. Comput. Sci. (ICS '11)", year = "2011", pages = "211--222" } @Article{ ggr, author = "Oded Goldreich and Shafi Goldwasser and Dana Ron", title = "Property testing and its connection to learning and approximation", journal = JACM, volume = "45", number = "4", year = "1998", issn = "0004-5411", pages = "653--750", doi = "10.1145/285055.285060", } @TechReport{ gowerswolf, author = "Timothy Gowers and Julia Wolf", title = "The true complexity of a system of linear equations", institution = "arXiv e-print archive", number = "0711.0185", eprint = {arxiv:0711.0185}, year = "2007" } @Article{ gre03, author = "Green, Ben", title = "A {S}zemer{\'e}di-type regularity lemma in abelian groups, with applications", journal = "Geom. Funct. Anal.", fjournal = GeomFunctAnal, volume = "15", year = "2005", number = "2", pages = "340--376", issn = "1016-443X", coden = "GFANFB", mrclass = "11B25 (11K38 11K45)", mrnumber = "2002k:11014", mrreviewer = "Hillel Furstenberg", doi="10.1007/s00039-005-0509-8" } @Article{ gt10, author = "Ben Green and Terence Tao", title = "Linear Equations in Primes", journal = AnnofMath, volume = "171", number = "3", pages = "1753--1850", year = "2010", doi="10.4007/annals.2010.171.1753" } @Article{ has97, author = "Johan H{\r{a}}stad", title = "Some optimal inapproximability results", journal = JACM, volume = "48", number = "4", year = "2001", issn = "0004-5411", pages = "798--859", doi = "10.1145/502090.502098", } @InProceedings{ jprz04, author = "Charanjit S. Jutla and Anindya C. Patthak and Atri Rudra and David Zuckerman", title = "Testing low-degree polynomials over prime fields", booktitle = "Proc. 45th FOCS", publisher=IEEEPUB, year = "2004", pages = "423--432", doi="10.1109/FOCS.2004.64" } @InProceedings{ kr04, author = "Tali Kaufman and Dana Ron", title = "Testing polynomials over general fields", booktitle = "Proc. 45th FOCS", publisher=IEEEPUB, year = "2004", pages = "413--422", doi="10.1109/FOCS.2004.64" } @InProceedings{ kaufmansudan08, author = "Tali Kaufman and Madhu Sudan", title = "Algebraic Property Testing: The Role of Invariance", booktitle = "Proc. 40th STOC", publisher=ACMPUB, year = "2008", pages = "403--412", ee = "http://doi.acm.org/10.1145/1374376.1374434", doi="10.1145/1374376.1374434" } @Article{ kralserravena1, author = "Daniel Kr\'{a}l{'} and Oriol Serra and Llu\'{i}s Vena", title = "A combinatorial proof of the Removal Lemma for Groups", journal = JCombinTheorySerA, volume = "116(4)", pages = "971--978", year = "2009", doi="10.1016/j.jcta.2008.12.003" } @techreport{ kralserravena2, author = "Daniel Kr\'al{'} and Oriol Serra and Llu\'{i}s Vena", title = "A Removal Lemma for Systems of Linear Equations over Finite Fields", institution = "arxiv e-print archive", number = "0809.1846", eprint = {arxiv:0809.1846}, year = "2008" } @Article{ parronsam, author = "Michal Parnas and Dana Ron and Alex Samorodnitsky", title = "Testing Basic {Boolean} Formulae", journal = SIAMJDiscreteMath, volume = 16, number = 1, year = 2003, issn = "0895-4801", pages = "20--46", doi = "10.1137/S0895480101407444", } @Article{ rubsud96, author = "Ronitt Rubinfeld and Madhu Sudan", title = "Robust Characterizations of Polynomials with Applications to Program Testing", journal = SIAMJComput, volume = "25", number = "2", pages = "252--271", year = "1996", url = "citeseer.ist.psu.edu/rubinfeld96robust.html", doi="10.1137/S0097539793255151" } @InProceedings{ samtre06, author = "Alex Samorodnitsky and Luca Trevisan", title = "Gowers uniformity, influence of variables, and {PCP}s", booktitle = "Proc. 38th STOC", year = "2006", isbn = "1-59593-134-1", pages = "11--20", location = "Seattle, WA, USA", doi = "10.1145/1132516.1132519", publisher = ACMPUB, address = "New York, NY, USA" } @InProceedings{ shapira, author = "Asaf Shapira", title = "Green's conjecture and testing linear-invariant properties", booktitle = "Proc. 41st STOC", publisher=ACMPUB, year = "2009", pages = "159--166", ee = "http://doi.acm.org/10.1145/1536414.1536438", doi="10.1145/1536414.1536438" } @Article{ tutte, author = "William T. Tutte", title = "Matroids and Graphs", journal = TransAmerMathSoc, volume = "90", pages = "527--552", year = "1959", doi="10.2307/1993185" } @Article{ tz10, author = "Terence Tao and Tamar Ziegler", title = "The inverse conjecture for the {G}owers norm over finite fields via the correspondence principle", journal = "Analysis \& PDE", volume = 3, number=1, pages = "1--20", year = "2010", doi="10.2140/apde.2010.3.1" } @Book{ wel76, author = "Dominic J.A. Welsh", title = "Matroid Theory", publisher = "Academic Press Inc.", address = "London", year = "1976" } %%%%%%%%%%%%%%%%%%%%%%%%%% %%%%% bib of v007a007 %%%%%%%%%%%%%%%%%%%%%%%%%% %% Theory of Computing %% File: v007a588.bib %% Publication date: April 2, 2011 %% Authors: Salman Beigi, Peter Shor, and John Watrous %% ToC#588 %% This BibTeX bibliography file was created using BibDesk. %% http://bibdesk.sourceforge.net/ %% Created for Salman Abolfathe Beikidezfuli at 2011-03-01 16:49:45 +0330 %% Saved with string encoding Unicode (UTF-8) @comment{Journal of the ACM} @string{JACM="J. ACM"} @comment{Journal of Computer and System Sciences} @string{JComputSystemSci="J. Comput. System Sci."} @comment{Linear Algebra and its Applications} @string{LinearAlgebraAppl="Linear Algebra Appl."} @comment{Communications in Mathematical Physics} @string{CommMathPhys="Comm. Math. Phys."} @comment{Institute of Electrical and Electronics Engineers. Transactions on Information Theory} @string{IEEETransInformTheory="IEEE Trans. Inform. Theory"} @comment{SIAM Journal on Computing} @string{SIAMJComput="SIAM J. Comput."} @comment{Reports on Mathematical Physics} @string{RepMathPhys="Rep. Math. Phys."} @comment{Journal of Mathematical Physics} @string{JMathPhys="J. Math. Phys."} @comment{Computational Complexity} @string{CompComplex="Comput. Complexity"} @comment{Theoretical Computer Science} @string{TheoretComputSci="Theoret. Comput. Sci."} @string{ACMPUB="ACM Press"} @string{IEEEPUB="IEEE Comp. Soc. Press"} @Book{ arorab09, author = "Sanjeev Arora and Boaz Barak", publisher = "Cambridge University Press", title = "Complexity Theory: A Modern Approach", year = "2009" } @InProceedings{ babai85, author = "L{\'a}szl{\'o} Babai", booktitle = "Proc. 17th STOC", date-modified = "2011-03-01 16:40:12 +0330", pages = "421--429", publisher = ACMPUB, title = "Trading group theory for randomness", year = "1985", doi="10.1145/22145.22192" } @Article{ babaim88, author = "L{\'a}szl{\'o} Babai and Shlomo Moran", journal = JComputSystemSci, number = "2", pages = "254--276", title = "{A}rthur-{M}erlin games: A randomized proof system, and a hierarchy of complexity classes", volume = "36", year = "1988", doi="10.1016/0022-0000(88)90028-1" } @Article{ choi75, author = "Man-Duen Choi", journal = LinearAlgebraAppl, number = "3", pages = "285--290", title = "Completely Positive Linear Maps on Complex Matrices", volume = "10", year = "1975", doi="10.1016/0024-3795(75)90075-0" } @Article{ christandlkmr07, author = "Matthias Christandl and Robert K{\"o}nig and Graeme Mitchison and Renato Renner", journal = CommMathPhys, number = "2", pages = "473--498", title = "One-and-a-half quantum de {Finetti} theorems", volume = "273", year = "2007", doi="10.1007/s00220-007-0189-3" } @Article{ fuchsvdg99, author = "Christopher A. Fuchs and Jeroen van de Graaf", journal = IEEETransInformTheory, number = "4", pages = "1216--1227", title = "Cryptographic distinguishability measures for quantum-mechanical states", volume = "45", year = "1999", doi="10.1109/18.761271" } @Book{ goldreich08, author = "Oded Goldreich", publisher = "Cambridge University Press", title = "Computational Complexity -- A Conceptual Perspective", year = "2008" } @Article{ goldreichmw91, author = "Oded Goldreich and Silvio Micali and Avi Wigderson", journal = JACM, number = "1", pages = "691--729", title = "Proofs that yield nothing but their validity or all languages in {NP} have zero-knowledge proof systems", volume = "38", year = "1991", doi="10.1145/116825.116852" } @InProceedings{ goldwassermr85, author = "Shafi Goldwasser and Silvio Micali and Charles Rackoff", booktitle = "Proc. 17th STOC", date-modified = "2011-03-01 16:41:24 +0330", pages = "291--304", publisher = ACMPUB, title = "The knowledge complexity of interactive proof systems", year = "1985", doi="10.1145/22145.22178" } @Article{ goldwassermr89, author = "Shafi Goldwasser and Silvio Micali and Charles Rackoff", journal = SIAMJComput, number = "1", pages = "186--208", title = "The knowledge complexity of interactive proof systems", volume = "18", year = "1989", doi="10.1137/0218012" } @InCollection{ goldwassers89, author = "Shafi Goldwasser and Michael Sipser", booktitle = "Randomness and Computation", editor = "S.~Micali", pages = "73--90", publisher = "JAI Press", series = "Advances in Computing Research", title = "Private coins versus public coins in interactive proof systems", volume = "5", year = "1989", } @Book{ grotschells93, author = "Martin Gr{\"o}tschel and L{\'a}szl{\'o} Lov\'asz and Alexander Schrijver", edition = "Second corrected", publisher = "Springer--Verlag", title = "Geometric Algorithms and Combinatorial Optimization", year = "1993" } @InProceedings{ gutoskiw07, author = "Gus Gutoski and John Watrous", booktitle = "Proc. 39th STOC", date-modified = "2011-03-01 16:42:16 +0330", pages = "565--574", publisher = ACMPUB, title = "Toward a general theory of quantum games", year = "2007", doi="10.1145/1250790.1250873" } @InProceedings{ jainjuw10, author = "Rahul Jain and Zhengfeng Ji and Sarvagya Upadhyay and John Watrous", booktitle = "Proc. 42nd STOC", date-modified = "2011-03-01 16:43:06 +0330", pages = "573--581", publisher = ACMPUB, title = "{QIP = PSPACE}", year = "2010", doi="10.1145/1806689.1806768" } @Article{ jamiolkowski72, author = "A. Jamio{\l}kowski", journal = RepMathPhys, number = "4", pages = "275--278", title = "Linear transformations which preserve trace and positive semidefiniteness of operators", volume = "3", year = "1972", doi="10.1016/0034-4877(72)90011-0" } @Book{ kitaevsv02, author = "A. Yu. Kitaev and A. H. Shen and M. N. Vyalyi", publisher = "American Mathematical Society", series = "Graduate Studies in Mathematics", title = "Classical and Quantum Computation", volume = "47", year = "2002" } @InProceedings{ kitaevw00, author = "Alexei Kitaev and John Watrous", booktitle = "Proc. 32nd STOC", date-modified = "2011-03-01 16:43:40 +0330", pages = "608--617", publisher = ACMPUB, title = "Parallelization, amplification, and exponential time simulation of quantum interactive proof system", year = "2000", doi="10.1145/335305.335387" } @Article{ konigr05, author = "Robert K{\"o}nig and Renato Renner", journal = JMathPhys, pages = "122108", title = "A de {Finetti} representation for finite symmetric quantum states", volume = "46", year = "2005", doi="10.1063/1.2146188" } @Article{ lundfkn92, author = "Carsten Lund and Lance Fortnow and Howard Karloff and Noam Nisan", journal = JACM, number = "4", pages = "859--868", title = "Algebraic methods for interactive proof systems", volume = "39", year = "1992", doi="10.1145/146585.146605" } @Article{ marriottw05, author = "Chris Marriott and John Watrous", journal = CompComplex, number = "2", pages = "122--152", title = "Quantum {Arthur-Merlin} games", volume = "14", year = "2005", doi="10.1007/s00037-005-0194-x" } @Book{ nielsenc00, author = "Michael A. Nielsen and Isaac L. Chuang", publisher = "Cambridge University Press", title = "Quantum Computation and Quantum Information", year = "2000" } @Article{ shamir92, author = "Adi Shamir", journal = JACM, number = "4", pages = "869--877", title = "{IP} $=$ {PSPACE}", volume = "39", year = "1992", doi="10.1145/146585.146609" } @InProceedings{ watrous02, author = "John Watrous", booktitle = "Proc. 43rd FOCS", date-modified = "2011-03-01 16:44:53 +0330", pages = "459--468", publisher = IEEEPUB, title = "Limits on the Power of Quantum Statistical Zero-Knowledge", year = "2002", doi="10.1109/SFCS.2002.1181970" } @article{ watrous99, author = "John Watrous", title = "{PSPACE} has constant-round quantum interactive proof systems", year = "2003", journal=TheoretComputSci, volume=292, number=3, pages="575--588", note = "Preliminary version in {\emph{Proc. 40th FOCS}}, 1999, pp. 112--119", doi="10.1016/S0304-3975(01)00375-9" } %%%%%%%%%%%%%%%%%%%%%%%%%% %%%%% bib of v007a008 %%%%%%%%%%%%%%%%%%%%%%%%%% %% Theory of Computing %% File: v007a491.bib %% Publication date: April 15, 2011 %% Authors: Pavel Hrubes and Amir Yehudayoff @comment{Journal of Complexity} @string{JComplexity="J. Complexity"} @comment{Computational Complexity} @string{CompComplex="Comput. Complexity"} @comment{Applicable Algebra in Engineering, Communication and Computing} @string{ApplAlgebraEngrgCommComput="Appl. Algebra Engrg. Comm. Comput."} @comment{Discrete Mathematics} @string{DiscreteMath="Discrete Math."} @comment{Advances in Applied Clifford Algebras} @string{AdvApplCliffordAlg="Adv. in Appl. Clifford Algebr."} @comment{Journal fur die Reine und Angewandte Mathematik} @string{JReineAngewMath="J. Reine Angew. Math."} @comment{Journal of Computer and System Sciences} @string{JComputSystemSci="J. Comput. System Sci."} @comment{Transactions of the American Mathematical Society} @string{TransAmerMathSoc="Trans. Amer. Math. Soc."} @string{ACMPUB="ACM Press"} @string{IEEEPUB="IEEE Comp. Soc. Press"} @Book{ burgisserbook, author = "Peter B{\"u}rgisser and Michael Clausen and Mohammad A. Shokrollahi", title = "Algebraic complexity theory", publisher = "Springer", volume = "315", series = "Grundlehren der mathematischen {W}issenschaften", year = "1997" } @Article{ burgisser, author = "Peter B{\"u}rgisser and Thomas Lickteig and Michael Shub", title = "Test complexity of generic polynomials", journal = JComplexity, volume = "8", number = "3", year = "1992", pages = "203--215", ee = "http://dx.doi.org/10.1016/0885-064X(92)90022-4", bibsource = "DBLP, http://dblp.uni-trier.de", doi="10.1016/0885-064X(92)90022-4", } @incollection{danilov, author = "V. I. Danilov", title = "Algebraic varieties and schemes", booktitle = "Algebraic Geometry: Algebraic Curves, Algebraic Manifolds and Schemes", editor = "I. R. Shafarevich", publisher = "Springer", volume = "23", series = "Algebraic Geometry I, Encyclopedia of Mathematical Sciences", year = "1994", pages = "167--297" } @InProceedings{ dvir, author = "Zeev Dvir", title = "Extractors for Varieties", booktitle = "Proc. 24th IEEE Conf. Comput. Complexity (CCC'09)", year = "2009", publisher = IEEEPUB, pages = "102--113", bibsource = "DBLP, http://dblp.uni-trier.de", doi="10.1109/CCC.2009.7" } @Article{ grigorievkarpinski, author = "Dima Grigoriev and Marek Karpinski and Andrew Chi-Chih Yao", title = "An exponential lower bound on the size of algebraic decision trees for {M}ax", journal = CompComplex, volume = "7", number = "3", year = "1998", pages = "193--203", ee = "http://link.springer.de/link/service/journals/00037/bibs/8007003/80070193.htm", bibsource = "DBLP, http://dblp.uni-trier.de", doi="10.1007/s000370050010" } @Article{ grigorievrazborov, author = "D. Grigoriev and A. Razborov", title = "Exponential Lower Bounds for Depth 3 Arithmetic Circuits in Algebras of Functions over Finite Fields", journal = ApplAlgebraEngrgCommComput, volume = "10", number = "6", year = "2000", pages = "465--487", ee = "http://dx.doi.org/10.1007/s002009900021", doi="10.1007/s002009900021", bibsource = "DBLP, http://dblp.uni-trier.de" } @Article{ pudlak, author = "P. Pudl{\'a}k and V. R{\"o}dl", title = "Some combinatorial-algebraic problems from complexity theory", journal = DiscreteMath, volume = "136", number = "1--3", year = "1994", pages = "253--279", ee = "http://dx.doi.org/10.1016/0012-365X(94)00115-Y", doi="10.1016/0012-365X(94)00115-Y", bibsource = "DBLP, http://dblp.uni-trier.de" } @InProceedings{ shpilkawigderson, author = "Amir Shpilka and Avi Wigderson", title = "Depth-3 arithmetic formulae over fields of characteristic zero", booktitle = "Proc. IEEE 14th Conf. Comput. Complexity (CCC'99)", year = "1999", pages = "87--96", publisher = IEEEPUB, doi="10.1109/CCC.1999.766267" } @Article{ clifford, author = "Ren\'{e} Schott and G. Stacey Staples", title = "Reductions in Computational Complexity Using {C}lifford Algebras", journal = AdvApplCliffordAlg, pages = "121--140", volume = "20", issue = "1", year = "2010", doi="10.1007/s00006-008-0143-2" } @InProceedings{ spira, author = "P. M. Spira", title = "On time-hardware complexity tradeoffs for {B}oolean functions", booktitle = "Proc. 4th. Hawaii Intern. Symp. Syst. Sciences.", year = "1971", pages = "525--527" } @Article{ strassen, author = "Volker Strassen", title = "Vermeidung von {D}ivisionen", journal = JReineAngewMath, year = "1973", volume = "264", pages = "184--202", doi="10.1515/crll.1973.264.184" } @Article{ valiantrigidity, author = "Leslie G. Valiant", title = "Graph-Theoretic Properties in computational Complexity", journal = JComputSystemSci, volume = "13", number = "3", year = "1976", pages = "278--285", bibsource = "DBLP, http://dblp.uni-trier.de", doi="10.1016/S0022-0000(76)80041-4" } @Article{ warren, author = "Hugh E. Warren", title = "Lower bounds for approximations by nonlinear manifolds", journal = TransAmerMathSoc, year = "1968", volume = "133", pages = "167--178", doi="10.2307/1994937", } %%%%%%%%%%%%%%%%%%%%%%%%%% %%%%% bib of v007a009 %%%%%%%%%%%%%%%%%%%%%%%%%% @comment{Journal of the ACM} @string{JACM="J. ACM"} @comment{Geometric and Functional Analysis} @string{GeomFunctAnal="Geom. Funct. Anal."} @comment{SIAM Journal on Computing} @string{SIAMJComput="SIAM J. Comput."} @comment{Proceedings of the Edinburgh Mathematical Society. Series II} @string{ProcEdinbMathSoc2="Proc. Edinb. Math. Soc. (2)"} @comment{Contributions to Discrete Mathematics} @string{ContribDiscreteMath="Contrib. Discrete Math."} @string{ACMPUB="ACM Press"} @string{IEEEPUB="IEEE Comp. Soc. Press"} @InProceedings{ ab, author = "Alon, Noga and Beigel, Richard", title = "Lower Bounds for Approximations by Low Degree Polynomials Over {$\mathbb{Z}_m$}", booktitle = "Proc. 16th Ann. IEEE Conf. Comput. Complexity (CCC)", year = "2001", pages = "184--187", url = "http://portal.acm.org/citation.cfm?id=872746.873129", acmid = "873129", doi="10.1109/CCC.2001.933885", publisher = IEEEPUB, address = "Washington, DC, USA" } @Article{ btz, author = "Bergelson, Vitaly and Tao, Terence and Ziegler, Tamar", affiliation = "Ohio State University Department of Mathematics Columbus OH 43210-1174 USA", title = "An Inverse Theorem for the Uniformity Seminorms Associated with the Action of $\mathbb{F}^{\infty}_{p}$", journal = GeomFunctAnal, publisher = {Birkh\"{a}user Basel}, issn = "1016-443X", keyword = "Mathematics and Statistics", pages = "1539--1596", volume = "19", issue = "6", url = "http://dx.doi.org/10.1007/s00039-010-0051-1", doi="10.1007/s00039-010-0051-1", year = "2010" } @Article{ bv, author = "Bogdanov, Andrej and Viola, Emanuele", title = "Pseudorandom Bits for Polynomials", journal = SIAMJComput, issue_date = "March 2010", volume = "39", issue = "6", month = "April", year = "2010", issn = "0097-5397", pages = "2464--2486", numpages = "23", url = "http://dx.doi.org/10.1137/070712109", doi = "10.1137/070712109", acmid = "1898203", keywords = "Gowers norm, bias, degree, polynomial, pseudorandom generator" } @Article{ gowers, author = "Timothy Gowers", title = "A new proof of {S}zemer{\'e}di's theorem", journal = GeomFunctAnal, volume = "11", number=3, year = "2001", pages = "465--588", doi="10.1007/s00039-001-0332-9" } @Article{ gt, author = "Ben Green and Terence Tao", title = "An inverse theorem for the {G}owers {$U^3(G)$} norm", journal = ProcEdinbMathSoc2, year = "2008", series = "1", volume = "51", pages = "73--153", doi="10.1017/S0013091505000325" } @Article{ gt07, author = "Ben Green and Terence Tao", title = "The distribution of polynomials over finite fields, with applications to the {G}owers norms", journal = ContribDiscreteMath, volume = "4", number = "2", pages = "1--36", year = "2009", note="\url{http://cdm.ucalgary.ca/index.php/cdm/article/view/133/98}" } @InProceedings{ lms08:full, author = "Lovett, Shachar and Meshulam, Roy and Samorodnitsky, Alex", title = "Inverse conjecture for the {G}owers norm is false", booktitle = "Proc. 40th STOC", year = "2008", isbn = "978-1-60558-047-0", location = "Victoria, British Columbia, Canada", pages = "547--556", numpages = "10", url = "http://doi.acm.org/10.1145/1374376.1374454", doi = "10.1145/1374376.1374454", acmid = "1374454", publisher = ACMPUB, address = "New York, NY, USA", keywords = "Gowers norm, low degree tests, multivariate polynomials" } @Book{ ms, author = "F. J. MacWilliams and N. J. A. Sloane", title = "The Theory of Error Correcting Codes", publisher = "Amsterdam, North-Holland", year = "1977" } @InProceedings{ sam, author = "Samorodnitsky, Alex", title = "Low-degree tests at large distances", booktitle = "Proc. 39th STOC", year = "2007", isbn = "978-1-59593-631-8", location = "San Diego, California, USA", pages = "506--515", numpages = "10", url = "http://doi.acm.org/10.1145/1250790.1250864", doi = "10.1145/1250790.1250864", acmid = "1250864", publisher = ACMPUB, address = "New York, NY, USA", keywords = "low-degree tests" } @Article{ sch, author = "Jacob T. Schwartz", title = "Fast probabilistic algorithms for verification of polynomial identities", journal = JACM, volume=27, number=4, pages = "701--717", year = "1980", doi="10.1145/322217.322225" } @Misc{ tao-blog, author = "Terence Tao", title = "Some notes on ``non-classical'' polynomials in finite characteristic", note = "Online blog: \url{http://terrytao.wordpress.com/2008/11/13/some-notes-on-non-classical-polynomials-in-finite-characteristic}." , year = "2008" } @InProceedings{ tao-lec, author = "Tao, Terence", booktitle = "Proc. 48th FOCS", title = "Structure and Randomness in Combinatorics", year = "2007", month = "October", pages = "3--15", keywords = "combinatorics;error term;pseudo-random component;combinatorial mathematics;", doi = "10.1109/FOCS.2007.17", issn = "0272-5428", publisher = ieeepub, } @Article{ tz, author = "Terence Tao and Tamar Ziegler", title = "The inverse conjecture for the {G}owers norm over finite fields via the correspondence principle", journal = "Analysis \& PDE", year = "2010", volume=3, number=1, pages = "1--20", doi="10.2140/apde.2010.3.1" } @Unpublished{ tz2, author = "Terence Tao and Tamar Ziegler", title = "The inverse conjecture for the {G}owers norm over finite fields in low characteristic", note = "Submitted", year = "2011" } @Article{ viola-survey, author = "Viola, Emanuele", title = "Guest Column: {Correlation} bounds for polynomials over $\{0,1\}$", journal = "SIGACT News", volume = 40, issue = 1, month = "February", year = 2009, issn = "0163-5700", pages = "27--44", numpages = 18, url = "http://doi.acm.org/10.1145/1515698.1515709", doi = "10.1145/1515698.1515709", acmid = 1515709, publisher = ACMPUB, address = "New York, NY, USA" } @article{ vw, author = "Viola, Emanuele and Wigderson, Avi", title = "Norms, {XOR} Lemmas, and Lower Bounds for Polynomials and Protocols", journal = "Theory of Computing", volume = "4", year = "2008", pages = "137--168", doi = "10.4086/toc.2008v004a007", } %%%%%%%%%%%%%%%%%%%%%%%%%% %%%%% bib of v007a010 %%%%%%%%%%%%%%%%%%%%%%%%%% @comment{SIAM Journal on Computing} @string{SIAMJComput="SIAM J. Comput."} @comment{Theory of Computing. An Open Access Journal} @string{TheoryComput="Theory Comput."} @comment{Quantum Information & Computation} @string{QuantumInfComput="Quantum Inf. Comput."} @comment{Theoretical Computer Science} @string{TheoretComputSci="Theoret. Comput. Sci."} @comment{Combinatorica. An International Journal on Combinatorics and the Theory of Computing} @string{Combinatorica="Combinatorica"} @comment{Lecture Notes in Computer Science} @string{LectureNotesinComputSci="Lecture Notes in Comput. Sci."} @string{ACMPUB="ACM Press"} @string{IEEEPUB="IEEE Comp. Soc. Press"} @Book{ dwo08, author = "Ronald de Wolf", title = "A Brief Introduction to Fourier Analysis on the Boolean Cube", year = "2008", pages = "1--20", publisher = "Theory of Computing Library", series="Graduate Surveys", number = "1", doi = {10.4086/toc.gs.2008.001} } @Article{ lee10, author = "Homin Lee", title = "Decision Trees and Influence: {An} Inductive Proof of the {OSSS} Inequality", year = 2010, pages = "81--84", journal = "Theory of Computing", volume = "6", number = "1", doi = {10.4086/toc.2010.v006a004} } @InProceedings{ osss05, author = "Ryan O'Donnell and Michael E. Saks and Oded Schramm and Rocco A. Servedio", title = "Every decision tree has an influential variable", booktitle = "Proc. 46th FOCS", year = "2005", pages = "31--39", publisher=IEEEPUB, doi="10.1109/SFCS.2005.34" } @Article{ klauck07, author = "Hartmut Klauck", title = "Lower bounds for quantum communication complexity", journal = SIAMJComput, year = "2007", volume = "1", pages = "20--46", doi="10.1137/S0097539702405620" } @InProceedings{ klauck10, author = "Hartmut Klauck", title = "A Strong Direct Product Theorem for {D}isjointness", booktitle = "Proc. 42nd STOC", year = "2010", pages = "77--86", publisher=ACMPUB, doi="10.1145/1806689.1806702" } @InProceedings{ jaink10, author = "Rahul Jain and Hartmut Klauck", title = "The Partition Bound for Classical Communication Complexity and Query Complexity", booktitle = "Proc. 25th IEEE Conf. Comput. Complexity (CCC)", year = "2010", pages = "247--258", doi="10.1109/CCC.2010.31", publisher=IEEEPUB } @InProceedings{ sherstov08, author = "Alexander Sherstov", title = "The pattern matrix method for lower bounds on quantum communication", booktitle = "Proc. 40th STOC", year = "2008", pages = "85--94", publisher=ACMPUB, doi="10.1145/1374376.1374392" } @Article{ sz09, author = "Yaoyun Shi and Yufan Zhu", title = "The quantum communication complexity of block-composed functions", journal = QuantumInfComput, volume = "9", number = "5\&6", year = "2009", pages = "444--460", note = {\url{http://www.rintonpress.com/journals/qic/}, \url{http://arxiv.org/pdf/0710.0095v4/}} } @InProceedings{ lz10, author = "Troy Lee and Shengyu Zhang", title = "Composition theorems in communication complexity", booktitle = "Proc. 37th Intern. Colloq. Autom. Lang. Program. (ICALP)", year = "2010", pages = "475--489", doi="10.1007/978-3-642-14165-2\_41", publisher="Springer", series=LectureNotesinComputSci, number=6198 } @InProceedings{ cr11, author = "Amit Chakrabarti and Oded Regev", title = "An Optimal Lower Bound on the Communication Complexity of {G}ap-{H}amming-{D}istance", booktitle = "Proc. 43th STOC", year = "2011", publisher=ACMPUB, doi="10.1145/1993636.1993644", pages="51--60" } @Article{ bdw02, author = "Harry Buhrman and Ronald de Wolf", title = "Complexity measures and decision tree complexity: {A} survey", journal = TheoretComputSci, volume = "288", number = "1", year = "2002", pages = "21--43", doi="10.1016/S0304-3975(01)00144-X" } @InProceedings{ odo08, author = "Ryan O'Donnell", title = "Some topics in analysis of {B}oolean functions", booktitle = "Proc. 40th STOC", year = "2008", pages = "569--578", publisher=ACMPUB, doi="10.1145/1374376.1374458" } @Article{ os07, author = "Ryan O'Donnell and Rocco Servedio", title = "Learning Monotone Decision Trees in Polynomial Time", journal = SIAMJComput, volume = "37", number = "3", year = "2007", pages = "827--844", doi="10.1137/060669309" } @Article{ haj91, author = "P{\'e}ter Hajnal", title = "An {$\Omega(n^{\mbox{4/3}})$} lower bound on the randomized complexity of graph properties.", journal = Combinatorica, volume = "11", number = "2", year = "1991", pages = "131--143", doi="10.1007/BF01206357" } @InProceedings{ ck01, author = "Amit Chakrabarti and Subhash Khot", title = "Improved Lower Bounds on the Randomized Complexity of Graph Properties", booktitle = "Proc. 28th Intern. Colloq. Autom. Lang. Program. (ICALP)", year = "2001", pages = "285--296", doi="10.1007/3-540-48224-5\_24", publisher="Springer", series=LectureNotesinComputSci, number=2076 } %%%%%%%%%%%%%%%%%%%%%%%%%% %%%%% bib of v007a011 %%%%%%%%%%%%%%%%%%%%%%%%%% %% Theory of Computing %% File: v007a651.bib %% Publication date: July 15, 2011 %% Authors: Elya Dolev and Dana Ron @comment{Journal of the ACM} @string{JACM="J. ACM"} @comment{Communications of the ACM} @string{CACM="CACM"} @comment{SIAM Journal on Computing} @string{SIAMJComput="SIAM J. Comput."} @comment{SIAM Journal on Discrete Mathematics} @string{SIAMJDiscreteMath="SIAM J. Discrete Math."} @comment{Journal of Computer and System Sciences} @string{JComputSystemSci="J. Comput. System Sci."} @comment{Theory of Computing. An Open Access Journal} @string{TheoryComput="Theory Comput."} @comment{Combinatorica. An International Journal on Combinatorics and the Theory of Computing} @string{Combinatorica="Combinatorica"} @comment{Algorithmica. An International Journal in Computer Science} @string{Algorithmica="Algorithmica"} @comment{Random Structures & Algorithms} @string{RandomStructuresAlgorithms="Random Structures Algorithms"} @comment{Annals of the Mathematical Statistics} @string{AnnMathStat="Ann. Math. Statist."} @comment{Lecture Notes in Computer Science} @string{LectureNotesinComputSci="Lecture Notes in Comput. Sci."} @string{ACMPUB="ACM Press"} @string{IEEEPUB="IEEE Comp. Soc. Press"} @Article{ blr, author = "Manuel Blum and Michael Luby and Ronitt Rubinfeld", year = "1993", title = "Self-Testing/Correcting with applications to numerical problems", journal = JComputSystemSci, volume = "47", number=3, pages = "549--595", doi="10.1016/0022-0000(93)90044-W" } @Article{ chernoff52, author = "Chernoff, H.", year = "1952", title = "A measure of asymptotic efficiency for tests of a hypothesis based on the sum of observations", journal = AnnMathStat, volume = "23", number=4, pages = "493--507", doi="10.1214/aoms/1177729330" } @InProceedings{ dlmorsw, title = "Testing for Concise Representations", author = "Ilias Diakonikolas and Homin K. Lee and Kevin Matulef and Krzysztof Onak and Ronitt Rubinfeld and Rocco A. Servedio and Andrew Wan", booktitle = "Proc. 48th FOCS", year = "2007", pages = "549--557", publisher=IEEEPUB, doi="10.1109/FOCS.2007.32" } @InProceedings{ dglrss, author = "Yevgeniy Dodis and Oded Goldreich and Eric Lehman and Sofya Raskhodnikova and Dana Ron and Alex Samorodnitsky", title = "Improved Testing Algorithms for Monotonocity", booktitle = "Proc. 3rd Intern. Workshop Random. and Approx. Tech. Comput. Sci. (RANDOM)", year = "1999", pages = "97--108", publisher="Springer", series=LectureNotesinComputSci, number=1671, doi="10.1007/978-3-540-48413-4\_10" } @Article{ ekkrv, author = "Funda Erg{\"u}n and Sampath Kannan and S. Ravi Kumar and Ronitt Rubinfeld and Mahesh Viswanathan", title = "Spot-Checkers", journal = JComputSystemSci, pages = "717--751", volume = "60", number = "3", year = "2000", doi="10.1006/jcss.1999.1692" } @Article{ fkrss, author = "Eldar Fischer and Guy Kindler and Dana Ron and Shmuel Safra and Alex Samorodnitsky", title = "Testing Juntas", journal = JComputSystemSci, volume = "68", number = "4", pages = "753--787", year = "2004", doi="10.1016/j.jcss.2003.11.004" } @Article{ gs, title = "Distribution-free testing lower bounds for basic {B}oolean functions", author = "Dana Glasner and Rocco A. Servedio", journal = {Theory of Computing}, volume = "5", number = "10", pages = "191--216", year = "2009", doi="10.4086/toc.2009.v005a010" } @Article{ gglrs, author = "Oded Goldreich and Shafi Goldwasser and Eric Lehman and Dana Ron and Alex Samorodinsky", title = "Testing Monotonicity", journal = Combinatorica, volume = "20", number = "3", pages = "301--337", year = "2000", doi="10.1007/s004930070011" } @Article{ ggr, author = "Oded Goldreich and Shafi Goldwasser and Dana Ron", title = "Property Testing and its Connection to Learning and Approximation", journal = JACM, year = "1998", volume = "45", number = "4", pages = "653--750", doi="10.1145/285055.285060" } @Article{ hk07, author = "Shirley Halevy and Eyal Kushilevitz", title = "Distribution-free property-testing", journal = SIAMJComput, pages = "1107--1138", volume = "37", number = "4", year = "2007", doi="10.1137/050645804" } @Article{ hk08a, author = "Shirley Halevy and Eyal Kushilevitz", title = "Distribution-free connectivity testing for sparse graphs", journal = Algorithmica, volume = "51", number = "1", pages = "24--48", year = "2008", doi="10.1007/s00453-007-9054-1" } @Article{ hk08b, author = "Shirley Halevy and Eyal Kushilevitz", title = "Testing monotonicity over graph products", journal = RandomStructuresAlgorithms, volume = "33", number = "1", pages = "44--67", year = "2008", doi="10.1002/rsa.20211" } @InProceedings{ kosa, title = "Tolerant Linearity Testing and Locally Testable Codes", author = "Swastik Kopparty and Shubhangi Saraf", year = "2009", booktitle = "Proc. 13th Intern. Workshop Random. and Approx. Tech. Comput. Sci. (RANDOM)", pages = "601--614", publisher="Springer", series=LectureNotesinComputSci, number=5687, doi="10.1007/978-3-642-03685-9\_45" } @Article{ mors, title = "Testing Halfspaces", author = "Kevin Matulef and Ryan O'Donnell and Ronitt Rubinfeld and Rocco A. Servedio", journal = SIAMJComput, volume = "39", number = "5", pages = "2004--2047", year = "2010", doi="10.1137/070707890" } @Article{ prr, author = "Michal Parnas and Dana Ron and Ronitt Rubinfeld", title = "Tolerant Property Testing and Distance Approximation", year = "2006", journal = JComputSystemSci, volume = "72", number = "6", pages = "1012--1042", doi="10.1016/j.jcss.2006.03.002" } @Article{ prs, author = "Michal Parnas and Dana Ron and Alex Samorodnitsky", title = "Testing Basic {B}oolean Formulae", journal = SIAMJDiscreteMath, volume = "16", number = "1", pages = "20--46", year = "2002", doi="10.1137/S0895480101407444" } @Article{ rs, author = "Ronitt Rubinfeld and Madhu Sudan", title = "Robust Characterization of Polynomials with Applications to Program Testing", journal = SIAMJComput, volume = "25", number = "2", pages = "252--271", year = "1996", doi="10.1137/S0097539793255151" } @InProceedings{ tur, author = "Gy{\"o}rgy Tur\'{a}n", title = "Lower bounds for {PAC} learning with queries", booktitle = "Proc. 6th Ann. ACM Conf. Comput. Learn. Theory (COLT)", year = "1993", pages = "384--391", publisher=ACMPUB, doi="10.1145/168304.168382" } @Article{ valiant84, author = "Valiant, Leslie~G.", title = "A Theory of the Learnable", journal = CACM, year = "1984", month = nov, volume = "27", number = "11", pages = "1134--1142", comment = "Defines `learnability' wrt EXAMPLES and ORACLE using arbitrary probability measure on event space. Shows k-CNF learnable from examples only.", doi="10.1145/1968.1972" } %%%%%%%%%%%%%%%%%%%%%%%%%% %%%%% bib of v007a012 %%%%%%%%%%%%%%%%%%%%%%%%%% %% Theory of Computing %% File: v007a012.bib %% Publication date: September 3, 2011 %% Authors: Scott Aaronson and Dieter van Melkebeek @comment{Computational Complexity} @string{CompComplex="Comput. Complexity"} @comment{Electronic Colloquium on Computational Complexity (ECCC)} @string{eccc="Electron. Colloq. on Comput. Complexity (ECCC)"} @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 Computing} @string{SIAMJComput="SIAM J. Comput."} @comment{Combinatorica. An International Journal on Combinatorics and the Theory of Computing} @string{Combinatorica="Combinatorica"} @comment{Theoretical Computer Science} @string{TheoretComputSci="Theoret. Comput. Sci."} @comment{Information and Control} @string{InfCont="Inf. Control"} @comment{Lecture Notes in Computer Science} @string{LectureNotesinComputSci="Lecture Notes in Comput. Sci."} @Article{ bfnw93, author = "L{\'a}szl{\'o} Babai and Lance Fortnow and Noam Nisan and Avi Wigderson", title = "{BPP} Has Subexponential Time Simulations Unless {EXPTIME} has Publishable Proofs", journal = CompComplex, volume = "3", year = "1993", pages = "307--318" } @Article{ im83, author = "Oscar Ibarra and Shlomo Moran", title = "Probabilistic algorithms for deciding equivalence of straight-line programs", journal = JACM, volume = "30", number = "1", pages = "217--228", year = "1983", doi="10.1145/322358.322373" } @Article{ ikw02, author = "Russell Impagliazzo and Valentine Kabanets and Avi Wigderson", title = "In search of an easy witness: {Exponential} time vs. probabilistic polynomial time", journal = JComputSystemSci, volume = "65", number = "4", year = "2002", pages = "672--694", doi="10.1016/S0022-0000(02)00024-7" } @Article{ isw06, author = "Russell Impagliazzo and Ronen Shaltiel and Avi Wigderson", title = "Reducing the seed length in the {N}isan-{W}igderson generators", journal = Combinatorica, volume = "26", number = "2", pages = "647--681", year = "2006", doi="10.1016/S0022-0000(02)00024-7" } @Article{ ki04, author = "Valentine Kabanets and Russell Impagliazzo", title = "Derandomizing polynomial identity tests means proving circuit lower bounds", journal = CompComplex, volume = "13", number = "1/2", year = "2004", pages = "1--46", doi="10.1007/s00037-004-0182-6" } @Article{ kannan82, author = "Ravi Kannan", title = "Circuit-size lower bounds and nonreducibility to sparse sets", year = "1982", journal = InfCont, pages = "40--56", volume = "55", number = "1--3", doi="10.1016/S0019-9958(82)90382-5" } @TechReport{ kvms10, author = "Jeff Kinne and Dieter van Melkebeek and Ronen Shaltiel", title = "Pseudorandom Generators, Typically-Correct Derandomization, and Circuit Lower Bounds", number = "TR10-129", institution = eccc, year = "2010", note = "A preliminary version of this paper appeared in the proceedings of \emph{RANDOM '09}; the full version will appear in a special issue of \emph{Computational Complexity}.", ee="http://eccc.hpi-web.de/report/2010/129/", eprint="eccc:TR10-129" } @InProceedings{ mvw99, author = "Peter Bro Miltersen and N. V. Vinodchandran and Osamu Watanabe", title = "Super-Polynomial Versus Half-Exponential Circuit Size in the Exponential Hierarchy", booktitle = "Proc. 5th Ann. Intern. Conf. Computing and Combinatorics (COCOON `99)", year = "1999", pages = "210--220", publisher = "Springer", series=LectureNotesinComputSci, number=1627, doi="10.1007/3-540-48686-0\_21" } @Article{ nis91, author = "Noam Nisan", title = "Pseudorandom bits for constant depth circuits", journal = Combinatorica, volume = "11", number = "1", year = "1991", pages = "63--70", doi="10.1016/S0022-0000(02)00024-7" } @Article{ nw94, author = "Noam Nisan and Avi Wigderson", title = "Hardness vs. randomness", journal = JComputSystemSci, volume = "49", number = "2", pages = "149--167", year = "1994", doi="10.1016/S0022-0000(05)80043-1" } @Article{ toda91, author = "Seinosuke Toda", title = "{PP} is as hard as the polynomial-time hierarchy", year = "1991", journal = SIAMJComput, pages = "865--877", volume = "20", number = "5", doi="10.1137/0220053" } @Article{ v79, author = "Leslie G. Valiant", title = "The Complexity of Computing the Permanent", journal = TheoretComputSci, volume = "8", number = "2", year = "1979", pages = "189--201", doi="10.1016/S0022-0000(02)00024-7" } %%%%%%%%%%%%%%%%%%%%%%%%%% %%%%% bib of v007a013 %%%%%%%%%%%%%%%%%%%%%%%%%% %% Theory of Computing %% File: v007a013.bib %% Publication date: September 14, 2011 %% Authors: Shachar Lovett @article{survey:arithmetic_circuits, author = {Shpilka, Amir and Yehudayoff, Amir}, title = {Arithmetic Circuits: {A} survey of recent results and open questions}, journal = {Found. Trends Theor. Comput. Sci.}, issue_date = {March 2010}, volume = {5}, issue = {3\&\#8211;4}, month = {March}, year = {2010}, issn = {1551-305X}, pages = {207--388}, numpages = {182}, url = {http://dx.doi.org/10.1561/0400000039}, doi = {10.1561/0400000039}, acmid = {1923902}, publisher = {Now Publishers Inc.}, address = {Hanover, MA, USA}, } @article{survey:partial_ders, author = {Xi Chen and Neeraj Kayal and Avi Wigderson}, title = {Partial derivatives in arithmetic complexity (and beyond)}, journal = {Found. Trends Theor. Comput. Sci.}, publisher = {Now Publishers Inc.}, address = {Hanover, MA, USA}, note = {To appear.}, } @article{YehudayoffHrubes09, author = {Pavel Hrube{\v{s}} and Amir Yehudayoff}, title = {Arithmetic Complexity in Ring Extensions}, year = {2011}, pages = {119-129}, doi = {10.4086/toc.2011.v007a008}, publisher = {Theory of Computing}, journal = {Theory of Computing}, volume = {7}, number = {1}, note = {\url{http://www.theoryofcomputing.org/articles/v007a008}}, } %%%%%%%%%%%%%%%%%%%%%%%%%% %%%%% bib of v008a001 %%%%%%%%%%%%%%%%%%%%%%%%%% %% Theory of Computing %% File: v007a014.bib %% Publication date: November 18, 2011 %% Authors: Dieter van Melkebeek and Thomas Watson @comment{Information Processing Letters} @string{InformProcessLett="Inform. Process. Lett."} @comment{SIAM Journal on Computing} @string{SIAMJComput="SIAM J. Comput."} @comment{Quantum Information & Computation} @string{QuantumInfComput="Quantum Inf. Comput."} @comment{Proceedings of The Royal Society of London. Series A. Mathematical, Physical and Engineering Sciences} @string{ProcRSocLondSerAMathPhysEngSci="Proc. R. Soc. Lond. Ser. A Math. Phys. Eng. Sci."} @comment{Journal of Computer and System Sciences} @string{JComputSystemSci="J. Comput. System Sci."} @comment{Journal of the ACM} @string{JACM="J. ACM"} @comment{Journal of Mathematical Physics} @string{JMathPhys="J. Math. Phys."} @comment{Russian Mathematical Surveys} @string{RussianMathSurveys="Russian Math. Surveys"} @comment{Physical Review Letters} @string{PhysRevLett="Phys. Rev. Lett."} @comment{Foundations and Trends in Theoretical Computer Science} @string{FoundTrendsTheorComputSci="Found. Trends Theor. Comput. Sci."} @comment{Mathematical Structures in Computer Science. A Journal in the Applications of Categorical, Algebraic and Geometric Methods in Computer Science} @string{MathStructuresComputSci="Math. Structures Comput. Sci."} @comment{Computational Complexity} @string{ComputComplexity="Comput. Complexity"} @comment{Information and Computation} @string{InformandComput="Inform. and Comput."} @comment{Physical Review. A. Third Series} @string{PhysRevA="Phys. Rev. A"} @string{IEEE="IEEE Comp. Soc. Press"} @string{ACM="ACM Press"} @article{ADH, author = "Adleman, Leonard and DeMarrais, Jonathan and Huang, Ming-Deh", title = "Quantum Computability", journal = SIAMJComput, volume = "26", number = "5", pages = "1524--1540", year = "1997", doi = {10.1137/S0097539795293639} } @inproceedings{AKRRV, author = "Allender, Eric and Kouck{\'y}, Michal and Ronneburger, Detlef and Roy, Sambuddha and Vinay, V.", title = "Time-Space Tradeoffs in the Counting Hierarchy", booktitle = "Proceedings of the 16th IEEE Conference on Computational Complexity", pages = "295--302", year = "2001", publisher=IEEE, ee = "http://www.computer.org/proceedings/ccc/1053/10530295abs.htm" } @article{AO, author = "Allender, Eric and Ogihara, Mitsunori", title = "Relationships Among {PL}, \#{L}, and the Determinant", journal = "RAIRO -- Theoretical Informatics and Applications", volume = "30", pages = "1--21", year = "1996" } @incollection{AW, author = "Allender, Eric and Wagner, Klaus", title = "Counting Hierarchies: {Polynomial} Time and Constant Depth Circuits", booktitle = "Current Trends in Theoretical Computer Science", editor = "Rozenberg, Grzegorz and Salomaa, Arto", pages = "469--483", publisher = "World Scientific", year = "1993" } @misc{Arn, author = "Arnold, Stefan", title = "Personal communication", month = "November", year = "2010" } @article{Bar, author = "Barenco, Adriano", title = "A Universal Two-Bit Gate for Quantum Computation", journal = ProcRSocLondSerAMathPhysEngSci, volume = "449", pages = "679--683", year = "1995", eprint = {jstor:52687} } @article{BBC+, author = "Barenco, Adriano and Bennett, Charles and Cleve, Richard and DiVincenzo, David and Margolus, Norman and Shor, Peter and Sleator, Tycho and Smolin, John and Weinfurter, Harald", title = "Elementary Gates for Quantum Computation", journal = PhysRevA, volume = "52", pages = "3457--3467", year = "1995", doi = {10.1103/PhysRevA.52.3457} } @article{BV, author = "Bernstein, Ethan and Vazirani, Umesh", title = "Quantum Complexity Theory", journal = SIAMJComput, volume = "26", number = "5", pages = "1411--1473", year = "1997", doi={10.1137/S0097539796300921} } @article{BMPRV, author = "Boykin, Patrick Oscar and Mor, Tal and Pulver, Matthew and Roychowdhury, Vwani and Vatan, Farrokh", title = "A New Universal and Fault-Tolerant Quantum Basis", journal = InformProcessLett, volume = "75", number = "3", pages = "101--107", year = "2000", doi={10.1016/S0020-0190(00)00084-3} } @article{CBL+, author = "Chiaverini, J. and Britton, J. and Leibfried, D. and Knill, E. and Barrett, M. and Blakestad, R. and Itano, W. and Jost, J. and Langer, C. and Ozeri, R. and Schaetz, T. and Wineland, D.", title = "Implementation of the Semiclassical Quantum {F}ourier Transform in a Scalable System", journal = "Science", volume = "308", number = "5724", pages = "997--1000", year = "2005", doi = {10.1126/science.1110335} } @article{DN, author = "Dawson, Christopher and Nielsen, Michael", title = "The {S}olovay-{K}itaev Algorithm", journal = QuantumInfComput, volume = "6", number = "1", pages = "81--95", year = "2006", } @article{Deutsch, author = "Deutsch, David", title = "Quantum Computational Networks", journal = ProcRSocLondSerAMathPhysEngSci, volume = "425", pages = "73--90", year = "1989", eprint = {jstor:2398494} } @article{DBE, author = "Deutsch, David and Barenco, Adriano and Ekert, Artur", title = "Universality in Quantum Computation", journal = ProcRSocLondSerAMathPhysEngSci, volume = "449", pages = "669--677", year = "1995", eprint={jstor:52686} } @article{DvM, author = "Diehl, Scott and van Melkebeek, Dieter", title = "Time-Space Lower Bounds for the Polynomial-Time Hierarchy on Randomized Machines", journal = SIAMJComput, volume = "36", number = "3", pages = "563--594", year = "2006", doi = {10.1137/050642228} } @article{DiV1, author = "DiVincenzo, David", title = "Two-Bit Gates are Universal for Quantum Computation", journal = PhysRevA, volume = "51", pages = "1015--1022", year = "1995", doi = {10.1103/PhysRevA.51.1015} } @article{DiV2, author = "DiVincenzo, David", title = "The Physical Implementation of Quantum Computation", journal = "Fortschritte der Physik", volume = "48", pages = "771--784", year = "2000" } @article{For, author = "Fortnow, Lance", title = "Time-Space Tradeoffs for Satisfiability", journal = JComputSystemSci, volume = "60", number = "2", pages = "337--353", year = "2000", doi = {10.1006/jcss.1999.1671} } @article{FLvMV, author = "Fortnow, Lance and Lipton, Richard and van Melkebeek, Dieter and Viglas, Anastasios", title = "Time-Space Lower Bounds for Satisfiability", journal = JACM, volume = "52", number = "6", pages = "835--865", year = "2005", doi = {10.1145/1101821.1101822} } @article{FR, author = "Fortnow, Lance and Rogers, John", title = "Complexity Limitations on Quantum Computation", journal = JComputSystemSci, volume = "59", number = "2", pages = "240--252", year = "1999", doi = {10.1006/jcss.1999.1651} } @book{GVL, author = "Golub, Gene and Van Loan, Charles", title = "Matrix Computations", edition = "Third", publisher = "The Johns Hopkins University Press", year = "1996" } @inproceedings{Grov, author = "Grover, Lov", title = "A Fast Quantum Mechanical Algorithm for Database Search", booktitle = "Proc. 28th STOC", pages = "212--219", year = "1996", doi = {10.1145/237814.237866}, publisher = acm } @article{HRC, author = "Harrow, Aram and Recht, Benjamin and Chuang, Isaac", title = "Efficient Discrete Approximations of Quantum Gates", journal = JMathPhys, volume = "43", number = "9", pages = "4445--4451", year = "2002", doi = {10.1063/1.1495899} } @inproceedings{Hesse, author = "Hesse, William", title = "Division is in Uniform {${\rm TC}^0$}", booktitle = "Proceedings of the 28th International Colloquium On Automata, Languages, and Programming", pages = "104--114", year = "2001", doi = {10.1007/3-540-48224-5\_9}, publisher = "Springer" } @book{HJ, author = "Horn, Roger and Johnson, Charles", title = "Topics in Matrix Analysis", publisher = "Cambridge University Press", year = "1994" } @article{Kit, author = "Kitaev, Alexei", title = "Quantum Computations: Algorithms and Error Correction", journal = RussianMathSurveys, volume = "52", number = "6", pages = "1191--1249", year = "1997", doi = {10.1070/RM1997v052n06ABEH002155} } @book{KSV, author = "Kitaev, Alexei and Shen, Alexander and Vyalyi, Mikhail", title = "Classical and Quantum Computation", publisher = "American Mathematical Society", year = "2002" } @article{Lloyd, author = "Lloyd, Seth", title = "Almost Any Quantum Logic Gate is Universal", journal = PhysRevLett, volume = "75", pages = "346--349", year = "1995", doi = {10.1103/PhysRevLett.75.346} } @article{MWY+, author = "Mariantoni, M. and Wang, H. and Yamamoto, T. and Neeley, M. and Bialczak, R. and Chen, Y. and Lenander, M. and Lucero, E. and O'Connell, A. and Sank, D. and Weides, M. and Wenner, J. and Yin, Y. and Zhao, J. and Korotkov, A. and Cleland, A. and Martinis, J.", title = "Implementing the Quantum von {N}eumann Architecture with Superconducting Circuits", journal = "Science Express", year = "2011", doi = {10.1126/science.1208517} } @article{vM, author = "van Melkebeek, Dieter", title = "A Survey of Lower Bounds for Satisfiability and Related Problems", journal = FoundTrendsTheorComputSci, volume = "2", pages = "197--303", year = "2007", doi = {10.1561/0400000012} } @techreport{MFR, author = "Mobasher, Amin and Fathololoumi, Saeed and Rahimi, Somayyeh", title = "Quantum Dot Quantum Computation", institution = "University of Waterloo Electrical and Computer Engineering Department", number = "2007-05", year = "2007" } @article{Nagy, author = "Nagy, Attila", title = "On an Implementation of the {S}olovay-{K}itaev Algorithm", journal = "CoRR", volume = "abs/quant-ph/0606077v1", year = "2006", eprint = "arxiv:quant-ph/0606077v1" } @book{NC, author = "Nielsen, Michael and Chuang, Isaac", title = "Quantum Computation and Quantum Information", publisher = "Cambridge University Press", year = "2000" } @article{PJ, author = "Perdrix, Simon and Jorrand, Philippe", title = "Classically Controlled Quantum Computation", journal = MathStructuresComputSci, volume = "16", number = "4", pages = "601--620", year = "2006", doi = {10.1016/j.entcs.2005.09.026} } @article{PMOB, author = "Politi, Alberto and Matthews, Jonathan and O'Brien, Jeremy", title = "{S}hor's Quantum Factoring Algorithm on a Photonic Chip", journal = "Science", volume = "325", number = "5945", pages = "1221", year = "2009", doi = {10.1126/science.1173731} } @article{Shi, author = "Shi, Yaoyun", title = "Both {T}offoli and Controlled-{NOT} Need Little Help to Do Universal Quantum Computation", journal = QuantumInfComput, volume = "3", number = "1", pages = "84--92", year = "2003" } @article{Shor, author = "Shor, Peter", title = "Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer", journal = SIAMJComput, volume = "26", number = "5", pages = "1484--1509", year = "1997", doi = {10.1137/S0097539795293172} } @article{Toda, author = "Toda, Seinosuke", title = "{PP} is as Hard as the Polynomial Time Hierarchy", journal = SIAMJComput, volume = "20", number = "5", pages = "865--877", year = "1991", doi = {10.1137/0220053} } @article{Wat2, author = "Watrous, John", title = "On the Complexity of Simulating Space-Bounded Quantum Computations", journal = "Computational Complexity", volume = "12", number = "1-2", pages = "48--84", year = "2003", doi = {10.1007/s00037-003-0177-8} } @article{Wat1, author = "Watrous, John", title = "Space-Bounded Quantum Complexity", journal = JComputSystemSci, volume = "59", number = "2", pages = "281--326", year = "1999", doi = {10.1006/jcss.1999.1655} } @article{Wil1, author = "Williams, Ryan", title = "Inductive Time-Space Lower Bounds for {SAT} and Related Problems", journal = ComputComplexity, volume = "15", number = "4", pages = "433--470", year = "2006", doi = {10.1007/s00037-007-0221-1} } @article{Wil2, author = "Williams, Ryan", title = "Time-Space Tradeoffs for Counting {NP} Solutions Modulo Integers", journal = ComputComplexity, volume = "17", number = "2", pages = "179--219", year = "2008", doi = {10.1007/s00037-008-0248-y} } @book{WM, author = "Wiseman, Howard and Milburn, Gerard", title = "Quantum Measurement and Control", publisher = "Cambridge University Press", year = "2009" } @article{YS, author = "Yakary{\i}lmaz, Abuzer and Say, A. C. Cem", title = "Unbounded-Error Quantum Computation with Small Space Bounds", journal = InformandComput, volume = "209", number = "6", pages = "873--892", year = "2011", doi = {10.1016/j.ic.2011.01.008} } %%%%%%%%%%%%%%%%%%%%%%%%%% %%%%% bib of v008a002 %%%%%%%%%%%%%%%%%%%%%%%%%% %%%%%%%%%%%%%%%%%%%%%%%%%% %%%%% bib of v008a003 %%%%%%%%%%%%%%%%%%%%%%%%%% @comment{Journal of the ACM} @string{jacm = "J. ACM"} @comment{SIAM Journal on Computing} @STRING{siamjc = "SIAM J. Comput."} @STRING{lncs = "LNCS"} @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 Univ. Press"} @STRING{cup = "Cambridge Univ. Press"} @STRING{ams = "Amer. Math. Soc."} @STRING{springer = "Springer"} @comment{Computational Geometry} @string{compgeo="Comput. Geom."} @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, GAFA} @string{GeomFunctAnal="Geom. Funct. Anal."} @comment{The Annals of Probability} @string{AnnProbab="Ann. Probab."} @comment{Discrete Applied Mathematics} @string{discamath="Discr. Appl. Math."} @string{doklady="Doklady Akademii Nauk SSSR, N.S."} @string{jsl="J. Symbolic Logic"} @string{dcs="Department of Computer Science"} @string{stoc82="Proc. 14th STOC"} @string{stoc87="Proc. 19th STOC"} @string{stoc89="Proc. 21st STOC"} @string{stoc91="Proc. 23rd STOC"} @string{stoc94="Proc. 26th STOC"} @string{stoc96="Proc. 28th STOC"} @string{stoc97="Proc. 29th STOC"} @string{stoc98="Proc. 30th STOC"} @string{stoc99="Proc. 31st STOC"} @string{stoc00="Proc. 32nd STOC"} @string{stoc04="Proc. 36th STOC"} @string{stoc05="Proc. 37th STOC"} @string{focs88="Proc. 29th FOCS"} @string{focs89="Proc. 30th FOCS"} @string{focs91="Proc. 32nd FOCS"} @string{focs99="Proc. 40th FOCS"} @string{focs00="Proc. 41st FOCS"} @string{focs01="Proc. 42nd FOCS"} @string{focs02="Proc. 43rd FOCS"} @string{focs03="Proc. 44th FOCS"} @string{focs04="Proc. 45th FOCS"} @string{focs05="Proc. 46th FOCS"} @string{soda=" Ann. ACM-SIAM Symp. on Discrete Algorithms"} @string{soda=" Ann. ACM-SIAM Symp. on Discrete Algorithms"} @string{soda92= "Proc. 3rd" # soda # " (SODA'92)"} @string{soda96= "Proc. 7th" # soda # " (SODA'96)"} @string{soda99= "Proc. 10th" # soda # " (SODA'99)"} @string{soda02= "Proc. 13th" # soda # " (SODA'02)"} @string{soda05= "Proc. 16th" # soda # " (SODA'05)"} @string{soda06= "Proc. 17th" # soda # " (SODA'06)"} @string{soda07= "Proc. 18th" # soda # " (SODA'07)"} @string{soda08= "Proc. 19th" # soda # " (SODA'08)"} @string{soda09= "Proc. 20th" # soda # " (SODA'09)"} @string{soda10= "Proc. 21st" # soda # " (SODA'10)"} @string{soda11= "Proc. 22nd" # soda # " (SODA'11)"} @string{stacs=" Ann. Symp. Theoretical Aspects of Comp. Sci."} @string{stacs02= "Proc. 19th" # stacs # " (STACS'02)"} @string{icalp=" Internat. Colloq. on Automata, Languages and Programming"} @string{icalp02= "Proc. 29th" # icalp # " (ICALP'02)"} @string{icalp07= "Proc. 34th" # icalp # " (ICALP'07)"} @string{pods=" Symp. on Principles of Database Systems"} @string{pods95= "Proc. 14th" # pods # " (PODS'95)"} @string{pods00= "Proc. 19th" # pods # " (PODS'00)"} @string{pods02= "Proc. 21st" # pods # " (PODS'02)"} @string{pods03= "Proc. 22nd" # pods # " (PODS'03)"} @string{sigmod=" ACM SIGMOD Internat. Conf. on Managment of Data"} @string{sigmod97=" 1997 " # sigmod} @string{sigmod98=" 1998 " # sigmod} @string{sigmod99=" 1999 " # sigmod} @string{cikm06="15th Internat. Conf. on Information and Knowledge Managment (CIKM'06)"} @string{micro96="Proc. 29th Ann. IEEE/ACM Internat. Symp. on Microarchitecture (MICRO'96)"} @string{wacg96="Proc. Workshop on Appl. Comp. Geometry (WACG'96)"} @string{scg=" Ann. Symp. on Computational Geometry"} @string{scg86= "Proc. 2nd" # scg # " (SCG'86)"} @string{scg99= "Proc. 15th" # scg # " (SCG'99)"} @string{vldb=" Internat. Conf. on Very Large Data Bases"} @string{vldb95="Proc. 21st" # vldb # " (VLDB'95)"} @string{vldb98="Proc. 24th" # vldb # " (VLDB'98)"} @string{vldb99="Proc. 25th" # vldb # " (VLDB'99)"} @string{vldb02="Proc. 28th" # vldb # " (VLDB'02)"} @string{wads95="Proc. 4th Internat. Workshop on Algorithms and Data Structures (WADS'95)"} @string{wads97="Proc. 5th Internat. Workshop on Algorithms and Data Structures (WADS'97)"} @string{icde01="Proc. 17th Internat. Conf. on Data Engineering (ICDE'01)"} @string{icde08="Proc. 24th Internat. Conf. on Data Engineering (ICDE'08)"} @string{icdt05="Proc. 10th Internat. Conf. on Database Theory (ICDT'05)"} @string{icdt07="Proc. 11th Internat. Conf. on Database Theory (ICDT'07)"} @string{cidr03="Proc. Conf. on Innovative Data Systems Res. (CIDR'03)"} @string{ipco99= "Proc. 7th Ann. Conf. on Integer Programming and Combinatorial Optimization"} %[1]. @ARTICLE{ackms, AUTHOR = "Alok Aggarwal and Don Coppersmith and Sanjeev Khanna and Rajeev Motwani and Baruch Schieber", TITLE = "The Angular-Metric Traveling Salesman Problem", JOURNAL = siamjc, VOLUME = 29, NUMBER = 3, PAGES = "697--711", YEAR = 1999, DOI = "10.1137/S0097539796312721" } %[2]. @inproceedings{afkmptz, author = "Gagan Aggarwal and Tom{\'a}s Feder and Krishnaram Kenthapadi and Rajeev Motwani and Rina Panigrahy and Dilys Thomas and An Zhu", title = "Anonymizing Tables", booktitle= icdt05, year = "2005", pages = "246--258", doi = "10.1007/978-3-540-30570-5\_17" } %[3]. @inproceedings{acm, author = "Donald Aingworth and Chandra Chekuri and Rajeev Motwani", title = "Fast Estimation of Diameter and Shortest Paths (without Matrix Multiplication)", booktitle = soda96, year = "1996", pages = "547--553" } %[4]. @ARTICLE{almss:pcp, AUTHOR = "Sanjeev Arora and Carsten Lund and Rajeev Motwani and Madhu Sudan and Mario Szegedy", TITLE = "Proof Verification and the Hardness of Approximation Problems", JOURNAL = jacm, VOLUME = 45, NUMBER = 3, PAGES = "501--555", YEAR = 1998, NOTE = "Preliminary version in FOCS'92", DOI = "10.1145/278298.278306" } %eprint="jacm:278298.278306" @article{bfl, Author = {L{\'a}szl{\'o} Babai and Lance Fortnow and Carsten Lund}, doi = {10.1007/BF01200056}, Journal = ccomplex, Number = 1, Pages = {3--40}, Title = {{Non-Deterministic Exponential Time has Two-Prover Interactive Protocols}}, Volume = {1}, Year = {1991} } @inproceedings{bfls, author = {L{\'a}szl{\'o} Babai and Lance Fortnow and Leonid A. Levin and Mario Szegedy}, title ={Checking computations in polylogarithmic time}, booktitle = stoc91, pages = "21--31", year = "1991", doi = "10.1145/103418.103428", } %[5]. @inproceedings{bdm, author = "Brian Babcock and Mayur Datar and Rajeev Motwani", title = "Sampling from a moving window over streaming data", booktitle = soda02, year = "2002", pages = "633--634" } %[6]. @inproceedings{bdmo, author = "Brian Babcock and Mayur Datar and Rajeev Motwani and Liadan O'Callaghan", title = "Maintaining variance and $k$-medians over data stream windows", booktitle = pods03, year = "2003", pages = "234--243", doi = "10.1145/773153.773176" } %[7]. @inproceedings{bms, author = "Sergey Brin and Rajeev Motwani and Craig Silverstein", title = "Beyond Market Baskets: Generalizing Association Rules to Correlations", booktitle = sigmod97, year = "1997", pages = "265--276", doi = "10.1145/253262.253327" } %[8]. @inproceedings{bmut, author = "Sergey Brin and Rajeev Motwani and Jeffrey D. Ullman and Shalom Tsur", title = "Dynamic Itemset Counting and Implication Rules for Market Basket Data", booktitle = sigmod97, year = "1997", pages = "255-264", doi = "10.1145/253262.253325" } %[9]. @inproceedings{bfjkmnptx, author = "Andrei Z. Broder and Marcus Fontoura and Vanja Josifovski and Ravi Kumar and Rajeev Motwani and Shubha U. Nabar and Rina Panigrahy and Andrew Tomkins and Ying Xu", title = "Estimating corpus size via queries", booktitle = cikm06, year = "2006", pages = "594--603", doi = "10.1145/1183614.1183699" } %[10]. @inproceedings{ccmn, author = "Moses Charikar and Surajit Chaudhuri and Rajeev Motwani and Vivek R. Narasayya", title = "Towards Estimation Error Guarantees for Distinct Values", booktitle = pods00, year = "2000", pages = "268--279", doi = "10.1145/335168.335230" } %[11]. @ARTICLE{ccfm, AUTHOR = "Moses Charikar and Chandra Chekuri and Tom{\'a}s Feder and Rajeev Motwani", TITLE = "Incremental Clustering and Dynamic Information Retrieval", JOURNAL = siamjc, VOLUME = 33, NUMBER = 6, PAGES = "1417--1440", YEAR = 2004, NOTE = "Preliminary version in STOC'97", DOI = "10.1137/S0097539702418498" } %[12]. @inproceedings{CharikarMRS97, author = {Moses Charikar and Rajeev Motwani and Prabhakar Raghavan and Craig Silverstein}, title = {Constrained {TSP} and low-power computing}, year = 1997, pages = {104--115}, booktitle = wads97, DOI = "10.1007/3-540-63307-3\_51" } %[13]. @inproceedings{cddmn, author = "Surajit Chaudhuri and Gautam Das and Mayur Datar and Rajeev Motwani and Vivek R. Narasayya", title = "Overcoming Limitations of Sampling for Aggregation Queries", booktitle = icde01, year = "2001", pages = "534--542" } %[14]. @inproceedings{cmn98, author = "Surajit Chaudhuri and Rajeev Motwani and Vivek R. Narasayya", title = "Random Sampling for Histogram Construction: How much is enough?", booktitle = sigmod98, year = "1998", pages = "436--447", doi = "10.1145/304181.304206" } %[15]. @inproceedings{cmn99, author = "Surajit Chaudhuri and Rajeev Motwani and Vivek R. Narasayya", title = "On random sampling over joins", booktitle = sigmod99, year = "1999", pages = "263--274", doi = "10.1145/304181.304206" } %[16]. @inproceedings{chm, author = "Chandra Chekuri and Waqar Hasan and Rajeev Motwani", title = "Scheduling Problems in Parallel Query Optimization", booktitle = pods95, year = "1995", pages = "255--265", doi = "10.1145/212433.212471" } %[17]. @ARTICLE{cmns, AUTHOR = "Chandra Chekuri and Rajeev Motwani and B. Natarajan and Clifford Stein", TITLE = "Approximation Techniques for Average Completion Time Scheduling", JOURNAL = siamjc, VOLUME = 31, NUMBER = 1, PAGES = "146--166", YEAR = 2001, NOTE = "Preliminary version in SODA'97", DOI = "10.1137/S0097539797327180" } %[18]. @ARTICLE{dgim, AUTHOR = "Mayur Datar and Aristides Gionis and Piotr Indyk and Rajeev Motwani", TITLE = "Maintaining stream statistics over sliding windows", JOURNAL = siamjc, VOLUME = 31, NUMBER = 6, PAGES = "1794--1813", YEAR = 2002, NOTE = "Preliminary version in SODA'02", DOI = "10.1137/S0097539701398363" } %[19]. @inproceedings{fsgmu, author = "Min Fang and Narayanan Shivakumar and Hector Garcia-Molina and Rajeev Motwani and Jeffrey D. Ullman", title = "Computing Iceberg Queries Efficiently", booktitle = vldb98, year = "1998", pages = "299--310", eprint = "VLDB:645924.671338" } %[20]. @ARTICLE{fm, AUTHOR = "Tom{\'a}s Feder and Rajeev Motwani", TITLE = "Clique Partitions, Graph Compression and Speeding-Up Algorithms", JOURNAL = jcss, VOLUME = 51, NUMBER = 2, PAGES = "261--271", YEAR = 1995, NOTE = "Preliminary version in STOC'91", DOI = "10.1006/jcss.1995.1065" } %[21,22]. @ARTICLE{fm10, AUTHOR = "Tom{\'a}s Feder and Rajeev Motwani", TITLE = "Finding large cycles in {H}amiltonian graphs", JOURNAL = discamath, VOLUME = 158, NUMBER = 8, PAGES = "882--893", YEAR = 2010, NOTE = "Preliminary version in SODA'05", DOI = "10.1016/j.dam.2009.12.006" } %[23]. @inproceedings{fms, author = "Tom{\'a}s Feder and Rajeev Motwani and Carlos S. Subi", title = "Finding long paths and cycles in sparse {H}amiltonian graphs", booktitle = stoc00, year = "2000", pages = "524--529", doi = "10.1145/335305.335368" } %[24]. @inproceedings{fhklmsv, author = "Paul W. Finn and Dan Halperin and Lydia E. Kavraki and Jean-Claude Latombe and Rajeev Motwani and Christian R. Shelton and Suresh Venkatasubramanian", title = "Geometric Manipulation of Flexible Ligands", booktitle = wacg96, year = "1996", pages = "67--78", publisher = "Springer", series = lncs, volume = "1148", doi = "10.1007/BFb0014486" } %[25]. @ARTICLE{fklmsvy, AUTHOR = "Paul W. Finn and Lydia E. Kavraki and Jean-Claude Latombe and Rajeev Motwani and Christian R. Shelton and Suresh Venkatasubramanian and A. Yao", TITLE = "RAPID: Randomized pharmacophore identification for drug design", JOURNAL = compgeo, VOLUME = 10, NUMBER = 4, PAGES = "263--272", YEAR = 1998, NOTE = "Preliminary version in SCG'97", DOI = "10.1016/S0925-7721(98)00008-X" } %[26]. @inproceedings{gimv, author = "Martin Gavrilov and Piotr Indyk and Rajeev Motwani and Suresh Venkatasubramanian", title = "Geometric Pattern Matching: A Performance Study", booktitle = scg99, year = "1999", pages = "79--85", doi = "10.1145/304893.304916" } %[27]. @inproceedings{GIM99, author = {Aristides Gionis and Piotr Indyk and Rajeev Motwani}, title = {Similarity Search in High Dimensions via Hashing}, booktitle = vldb99, year = 1999, publisher = {Morgan Kaufmann Publishers Inc.}, pages = {518--529}, eprint="vldb:645925.671516", } %[28]. @inproceedings{gm, author = "Michael H. Goldwasser and Rajeev Motwani", title = "Intractability of Assembly Sequencing: Unit Disks in the Plane", booktitle = wads97, year = "1997", pages = "307--320", publisher = "Springer", series = lncs, volume = "1272", doi = "10.1007/3-540-63307-3\_70", } %[29]. @inproceedings{gmmo, author = "Sudipto Guha and Nina Mishra and Rajeev Motwani and Liadan O'Callaghan", title = "Clustering Data Streams", booktitle = focs00, year = "2000", pages = "359--366", doi = "10.1109/SFCS.2000.892124" } %[30]. @inproceedings{gmr, author = "Leonidas J. Guibas and Rajeev Motwani and Prabhakar Raghavan", title = "The Robot Localization Problem in Two Dimensions", booktitle = soda92, year = "1992", pages = "259--268" } %[31]. @inproceedings{hm, author = "Waqar Hasan and Rajeev Motwani", title = "Coloring Away Communication in Parallel Query Optimization", booktitle = vldb95, year = "1995", pages = "239--250", } %[32]. @ARTICLE{hlm, AUTHOR = "David Hsu and Jean-Claude Latombe and Rajeev Motwani", TITLE = "Path Planning in Expansive Configuration Spaces", JOURNAL = {Int. J. Comput. Geometry Appl.}, VOLUME = 9, NUMBER = "4-5", PAGES = "495--512", YEAR = 1999, NOTE = "Preliminary version in ICRA'97", } %[33]. @inproceedings {IM98, AUTHOR = {Piotr Indyk and Rajeev Motwani}, TITLE = {Approximate nearest neighbors: towards removing the curse of dimensionality}, BOOKTITLE = stoc98, PAGES = {604--613}, YEAR = {1998}, publisher = {ACM Press}, DOI = "10.1145/276698.276876", } % eprint="stoc:10.1145/276698.276876" %[34]. @inproceedings {imrv, AUTHOR = {Piotr Indyk and Rajeev Motwani and Prabhakar Raghavan and Santosh Vempala}, TITLE = {Locality-Preserving Hashing in Multidimensional Spaces}, BOOKTITLE = stoc97, PAGES = {618--625}, YEAR = {1997}, DOI = "10.1145/258533.258656" } %[35]. @inproceedings{imv, author = "Piotr Indyk and Rajeev Motwani and Suresh Venkatasubramanian", title = "Geometric Matching Under Noise: Combinatorial Bounds and Algorithms", booktitle = soda99, year = "1999", pages = "457--465" } %[36]. @ARTICLE{kmr, AUTHOR = "David R. Karger and Rajeev Motwani and G. D. S. Ramkumar", TITLE = "On Approximating the Longest Path in a Graph", JOURNAL = {Algorithmica}, VOLUME = 18, NUMBER = 1, PAGES = "82--98", YEAR = 1997, NOTE = "Preliminary version in WADS'93", DOI = "10.1007/BF02523689" } %[37]. @ARTICLE{kms, AUTHOR = "David R. Karger and Rajeev Motwani and Madhu Sudan", TITLE = "Approximate Graph Coloring by Semidefinite Programming", JOURNAL = jacm, VOLUME = 45, NUMBER = 2, PAGES = "246--265", YEAR = 1998, NOTE = "Preliminary version in FOCS'94", DOI = "10.1145/274787.274791" } %[38]. @ARTICLE{klmr, AUTHOR = "Lydia E. Kavraki and Jean-Claude Latombe and Rajeev Motwani and Prabhakar Raghavan", TITLE = "Randomized Query Processing in Robot Path Planning", JOURNAL = jcss, VOLUME = 57, NUMBER = 1, PAGES = "50--66", YEAR = 1998, NOTE = "Preliminary version in STOC'95", DOI = "10.1006/jcss.1998.1578" } %[39]. @inproceedings {km, AUTHOR = {Sanjeev Khanna and Rajeev Motwani}, TITLE = {Towards a Syntactic Characterization of {PTAS}}, BOOKTITLE = stoc96, PAGES = {329--337}, YEAR = {1996}, DOI = "10.1145/237814.237979" } %[40]. @ARTICLE{kmsv, AUTHOR = "Sanjeev Khanna and Rajeev Motwani and Madhu Sudan and Umesh V. Vazirani", TITLE = "On Syntactic versus Computational Views of Approximability", JOURNAL = siamjc, VOLUME = 28, NUMBER = 1, PAGES = "164--191", YEAR = 1998, NOTE = "Preliminary version in FOCS'94", DOI = "10.1137/S0097539795286612" } %[41]. @inproceedings{kmnx, author = "Aleksandra Korolova and Rajeev Motwani and Shubha U. Nabar and Ying Xu", title = "Link Privacy in Social Networks", booktitle = icde08, publisher = "IEEE", year = "2008", pages = "1355--1357", doi = "10.1109/ICDE.2008.4497554" } @Article{lfkn, author = "Carsten Lund and Lance Fortnow and Howard Karloff and Noam Nisan", journal = jacm, number = "4", pages = "859--868", title = "Algebraic methods for interactive proof systems", volume = "39", year = "1992", doi="10.1145/146585.146605" } %[42]. @inproceedings{smm, author = "Gurmeet Singh Manku and Rajeev Motwani", title = "Approximate Frequency Counts over Data Streams", booktitle = vldb02, year = "2002", pages = "346--357", doi = "10.1016/B978-155860869-6/50038-X" } %[43]. @inproceedings{m89, author = "Rajeev Motwani", title = "Expanding Graphs and the Average-case Analysis of Algorithms for Matchings and Related Problems", booktitle = stoc89, year = "1989", pages = "550--561", doi = "10.1145/73007.73060" } %[44]. @ARTICLE{mnp, AUTHOR = "Rajeev Motwani and Assaf Naor and Rina Panigrahy", TITLE = "Lower Bounds on Locality Sensitive Hashing", JOURNAL = {SIAM J. Discrete Math.}, VOLUME = 21, NUMBER = 4, PAGES = "930--935", YEAR = 2007, NOTE = "Preliminary version in SCG'06", DOI = "10.1137/050646858" } %[45]. @ARTICLE{mnn, AUTHOR = "Rajeev Motwani and Joseph Naor and Moni Naor", TITLE = "The probabilistic method yields deterministic parallel algorithms", JOURNAL = jcss, VOLUME = 49, NUMBER = 3, PAGES = "478--516", YEAR = 1994, NOTE = "Preliminary version in FOCS'89", DOI = "10.1016/S0022-0000(05)80069-8 " } %[46]. @inproceedings {mpx07, AUTHOR = {Rajeev Motwani and Rina Panigrahy and Ying Xu}, TITLE = {Estimating Sum by Weighted Sampling}, BOOKTITLE = icalp07, PAGES = {53--64}, YEAR = {2007}, DOI = "10.1007/978-3-540-73420-8\_7", } %[47]. @ARTICLE{mpt, AUTHOR = "Rajeev Motwani and Steven Phillips and Eric Torng", TITLE = "Non-Clairvoyant Scheduling", JOURNAL = tcs, VOLUME = 130, NUMBER = 1, PAGES = "17--47", YEAR = 1994, NOTE = "Preliminary version in SODA'93", DOI = "10.1016/0304-3975(94)90151-1" } %[48]. @inproceedings {mr86, AUTHOR = {Rajeev Motwani and Prabhakar Raghavan}, TITLE = {Deferred Data Structuring: Query-Driven Preprocessing for Geometric Search Problems}, BOOKTITLE = scg86, PAGES = {303--312}, YEAR = {1986}, DOI = "10.1145/10515.10548" } %[49]. @inproceedings {mrs, AUTHOR = {Rajeev Motwani and Arvind Raghunathan and Huzur Saran}, TITLE = {Constructive Results from Graph Minors: Linkless Embeddings}, BOOKTITLE = focs88, PAGES = {398--409}, YEAR = {1988}, DOI= "10.1109/SFCS.1988.21956" } %[50]. @inproceedings {mwabbdmorv, AUTHOR = {Rajeev Motwani and Jennifer Widom and Arvind Arasu and Brian Babcock and Shivnath Babu and Mayur Datar and Gurmeet Singh Manku and Chris Olston and Justin Rosenstein and Rohit Varma}, TITLE = {Query Processing, Approximation, and Resource Management in a Data Stream Management System}, BOOKTITLE = cidr03, YEAR = {2003} } %[51]. @ARTICLE{br, AUTHOR = "Bonnie Berger and John Rompel", TITLE = "Simulating $(\log ^c n)$-wise Independence in {NC}", JOURNAL = jacm, VOLUME = 38, NUMBER = 4, PAGES = "1026--1046", YEAR = 1991, NOTE = "Preliminary version in FOCS'89", DOI = "10.1145/115234.115347" } %[52]. @ARTICLE{as, AUTHOR = "Sanjeev Arora and Shmuel Safra", TITLE = "Probabilistic Checking of Proofs: A New Characterization of {NP}", JOURNAL = jacm, VOLUME = 45, NUMBER = 1, PAGES = "70--122", YEAR = 1998, NOTE = "Preliminary version in FOCS'92", DOI = "10.1145/273865.273901" } %[53]. @article{fglss, AUTHOR = {Uriel Feige and Shafi Goldwasser and L{\'a}szl{\'o} Lov{\'a}sz and Shmuel Safra and Mario Szegedy}, TITLE = {Interactive proofs and the hardness of approximating cliques}, journal = jacm, volume = "43", number = "2", year = "1996", pages = "268--292", doi = "10.1145/226643.226652", note = "Preliminary version in FOCS'91", } %[54]. @InProceedings{GoemansWilliamson:94, author = "Michel X. Goemans and David P. Williamson", title = "$.878$-approximation algorithms for {MAX} {CUT} and {MAX} 2{SAT}", booktitle = stoc94, pages = "422--431", year = "1994", publisher = "ACM Press", address = "New York", cdate = "1970-01-01", mdate = "2005-08-18", doi = "10.1145/195058.195216", } % eprint = {stoc:195058.195216}, %[55]. @Article{PapaYanna91, Author = {Christos H. Papadimitriou and Mihalis Yannakakis}, Title = {Optimization, approximation, and complexity classes}, Journal = jcss, Volume = 43, year = 1991, Pages = {425--440}, number=3, doi = "10.1016/0022-0000(91)90023-X" } % eprint="jcss:10.1016/0022-0000(91)90023-X" %[56]. @techreport{pbmwTech, AUTHOR = {Lawrence Page and Sergey Brin and Rajeev Motwani and Terry Winograd}, TITLE = {The PageRank Citation Ranking: Bringing Order to the Web}, INSTITUTION = {Stanford InfoLab}, YEAR = {1999} } @Article{ shamir92, author = "Adi Shamir", journal = jacm, number = "4", pages = "869--877", title = "{IP} $=$ {PSPACE}", volume = "39", year = "1992", doi="10.1145/146585.146609" } %[57]. @inproceedings{wigderson, AUTHOR = {Avi Wigderson}, TITLE = {A New Approximate Graph Coloring Algorithm}, BOOKTITLE = stoc82, PAGES = {325--329}, YEAR = {1982}, DOI = "10.1145/800070.802207" } %[58]. @inproceedings{cm, author = "Chandra Chekuri and Rajeev Motwani", title = "Minimizing Weighted Completion Time on a Single Machine", booktitle = soda99, year = "1999", pages = "873--874" } %[59]. @inproceedings{cjmnrs, author = "Chandra Chekuri and Richard Johnson and Rajeev Motwani and B. Natarajan and B. Ramakrishna Rau and Michael S. Schlansker", title = "Profile-driven Instruction Level Parallel Scheduling with Application to Super Blocks", booktitle = micro96, year = "1996", pages = "58--67", doi = "10.1109/MICRO.1996.566450" } %[LinialSasson] @ARTICLE{LinialSasson, AUTHOR = "Nathan Linial and Ori Sasson", TITLE = "Non-Expansive Hashing", JOURNAL = comba, VOLUME = 18, NUMBER = 1, PAGES = "121--132", YEAR = 1998, NOTE = "Preliminary version in STOC'96", DOI = "10.1007/PL00009805" } %%%%%%%%%%%%%%%%%%%%%%%%%% %%%%% bib of v008a004 %%%%%%%%%%%%%%%%%%%%%%%%%% @string{soda=" Ann. ACM-SIAM Symp. on Discrete Algorithms"} @string{icalp=" Internat. Colloq. on Automata, Languages and Programming"} @STRING{acm = "ACM Press" } @STRING{algorithmica="Algorithmica" } @STRING{annofmath="Ann. of Math." } @STRING{focs71 = "Proc. 12th FOCS (SWAT'71)" } @STRING{focs96 = "Proc. 37th FOCS" } @STRING{focs99 = "Proc. 40th FOCS" } @STRING{focs03 = "Proc. 44th FOCS" } @STRING{focs05 = "Proc. 46th FOCS" } @STRING{focs10 = "Proc. 51st FOCS" } @STRING{icalp08 = "Proc. 35th" # icalp # " (ICALP'08)" } @STRING{ieee = "IEEE Comp. Soc. Press" } @STRING{infcont = "Inf. Control" } @STRING{informandcomput="Inform. and Comput." } @STRING{israeljmath="Israel J. Math." } @STRING{jacm = "J. ACM" } @STRING{jalgorithms="J. Algorithms" } @STRING{jcomputsystemsci="J. Comput. System Sci." } @STRING{jsymboliccomput="J. Symbolic Comput." } @STRING{siamjcomput="SIAM J. Comput." } @STRING{siamjdiscretemath="SIAM J. Discrete Math." } @STRING{soda07 = "Proc. 18th" # soda # " (SODA'07)" } @STRING{soda10 = "Proc. 21st" # soda # " (SODA'10)" } @STRING{springer= "Springer" } @STRING{stoc88 = "Proc. 20th STOC" } @STRING{stoc06 = "Proc. 38th STOC" } @STRING{stoc07 = "Proc. 39th STOC" } @STRING{stoc09 = "Proc. 41st STOC" } @STRING{stoc10 = "Proc. 42nd STOC" } @STRING{stoc12 = "Proc. 44th STOC" } @Article{ aingworth, author = {Donald Aingworth and Chandra Chekuri and Piotr Indyk and Rajeev Motwani}, title = {Fast Estimation of Diameter and Shortest Paths (Without Matrix Multiplication)}, journal = siamjcomput, volume = 28, number = 4, note = {Preliminary version in SODA'96}, year = 1999, pages = {1167--1181}, doi = {10.1137/S0097539796303421} } @inproceedings{vw12, author = {Vassilevska~Williams, Virginia}, title = {Multiplying matrices faster than {C}oppersmith-{W}inograd}, booktitle = stoc12, note = {To appear}, year = {2012} } @InProceedings{ vww, author = {Vassilevska~Williams, Virginia and Ryan Williams}, title = {Subcubic equivalences between path, matrix, and triangle problems}, crossref = {pfocs10}, pages = {645--654}, doi = {10.1109/FOCS.2010.67} } @Article{ fox, author = {Jacob Fox}, title = {A new proof of the graph removal lemma}, journal = annofmath, year = {2011}, volume = {174}, number = {1}, pages = {561--579}, doi = {10.4007/annals.2011.174.1.17} } @Article{ ksv, author = {Daniel Kr\'{a}l and Oriol Serra and Llu\'{i}s Vena}, title = {A removal lemma for systems of linear equations over finite fields}, journal = israeljmath, year = {2012}, volume = {187}, number = {1}, pages = {193--207}, doi = {10.1007/s11856-011-0080-y} } @Article{ bard2, author = {Martin Albrecht and Gregory Bard and William Hart}, title = {Algorithm 898: {Efficient} multiplication of dense matrices over {GF(2)}}, journal = {ACM Trans. Math. Softw.}, volume = {37}, number = {1}, year = {2010}, doi = {10.1145/1644001.1644010} } @Article{ adlry, author = {Noga Alon and Richard A. Duke and Hanno Lefmann and Vojtech R{\"o}dl and Raphael Yuster}, title = {The Algorithmic Aspects of the Regularity Lemma}, journal = jalgorithms, volume = {16}, number = {1}, year = {1994}, pages = {80--109}, note = { Preliminary version in FOCS'92}, doi = {10.1006/jagm.1994.1005} } @Article{ afks, author = {Noga Alon and Eldar Fischer and Michael Krivelevich and Mario Szegedy}, title = {Efficient Testing of Large Graphs}, journal = {Combinatorica}, volume = {20}, number = {4}, year = {2000}, pages = {451--476}, note = {Preliminary version in FOCS'99}, doi = {10.1007/s004930070001} } @Article{ an04, author = {Noga Alon and Assaf Naor}, title = {Approximating the Cut-Norm via {G}rothendieck's Inequality}, journal = siamjcomput, volume = {35}, number = {4}, year = {2006}, pages = {787--803}, note = {Preliminary version in STOC'04}, doi = {10.1137/S0097539704441629} } @Article{ afns, author = {Noga Alon and Eldar Fischer and Ilan Newman and Asaf Shapira}, title = {A Combinatorial Characterization of the Testable Graph Properties: {It's} All About Regularity}, journal = siamjcomput, volume = {39}, number = {1}, year = {2009}, pages = {143--167}, note = {Preliminary version in STOC'06}, doi = {10.1137/060667177} } @Article{ angluin, author = {Dana Angluin}, title = {The four {R}ussians' algorithm for {B}oolean matrix multiplication is optimal for its class}, journal = {SIGACT News}, pages = {29--33}, year = {1976}, volume = {1}, doi = {10.1145/1008591.1008593} } @Article{ adkf70, author = { V. Z. Arlazarov and E. A. Dinic and M. A. Kronrod and I. A. Faradzhev}, title = { On economical construction of the transitive closure of a directed graph}, journal = { Soviet Mathematics Doklady}, number = {5}, volume = {11}, pages = {1209--1210}, year = { 1970} } @Article{ as88, author = {Michael D. Atkinson and Nicola Santoro}, title = {A Practical Algorithm for {B}oolean Matrix Multiplication}, journal = {Inf. Process. Lett.}, volume = {29}, numbers = {1}, year = {1988}, pages = {37--38}, doi = {10.1016/0020-0190(88)90130-5} } @Misc{ bkm95, author = { Julien Basch and Sanjeev Khanna and Rajeev Motwani}, title = { On Diameter Verification and {B}oolean Matrix Multiplication}, note = {Technical Report No. STAN-CS-95-1544, Department of Computer Science, Stanford University}, year = { 1995} } @Article{ beh, author = { F. A. Behrend}, title = { On sets of integers which contain no three terms in arithmetic progression}, journal = { Proc. Nat. Acad. Sci.}, volume = {32}, pages = { 331--332}, year = { 1946}, number = {12} } @Article{ bcsx, author = {Arnab Bhattacharyya and Victor Chen and Madhu Sudan and Ning Xie}, title = {Testing Linear-Invariant Non-Linear Properties}, journal = {\href{http://www.theoryofcomputing.org/articles/main}{Theory of Computing}}, year = {2011}, volume = {7}, pages = {75--99}, note = {Preliminary version in STACS'06}, doi = {10.4086/toc.2011.v007a006}, } @InProceedings{ bcl, author = {Christian Borgs and Jennifer T. Chayes and L{\'a}szl{\'o} Lov{\'a}sz and Vera T. S{\'o}s and Bal{\'a}zs Szegedy and Katalin Vesztergombi}, title = {Graph limits and parameter testing}, crossref = {pstoc06}, year = {2006}, pages = {261--270}, doi = {10.1145/1132516.1132556} } @InProceedings{ icalp08, author = {Guy E. Blelloch and Virginia Vassilevska and Ryan Williams}, title = {A New Combinatorial Approach for Sparse Graph Problems}, booktitle = icalp08, year = {2008}, pages = {108--120}, doi = {10.1007/978-3-540-70575-8\_10} } @Misc{ avrim, author = {Avrim Blum}, note = {Personal communication}, year = 2009 } @InProceedings{ chan07, author = {Timothy M. Chan}, title = {More algorithms for all-pairs shortest paths in weighted graphs}, crossref = {pstoc07}, pages = { 590--598}, doi = {10.1145/1250790.1250877} } @Article{ mmexperiments, author = { Siddhartha Chatterjee and Alvin R. Lebeck and Praveen K. Patnala and Mithuna Thottethodi}, title = { Recursive array layouts and fast matrix multiplication}, journal = { IEEE Trans. on Parallel and Distributed Systems}, volume = { 13}, issue = {11}, pages = {1105--1123}, year = {2002}, doi = {10.1109/TPDS.2002.1058095} } @Article{ ccf, author = {Amin Coja-Oghlan and Colin Cooper and Alan M. Frieze}, title = {An Efficient Sparse Regularity Concept}, journal = siamjdiscretemath, volume = {23}, number = {4}, year = {2010}, pages = {2000--2034}, doi = {10.1137/080730160} } @InProceedings{ cohnumans, author = {Henry Cohn and Christopher Umans}, title = {A Group-Theoretic Approach to Fast Matrix Multiplication}, crossref = {pfocs03}, pages = {438--449}, doi = {10.1109/SFCS.2003.1238217} } @InProceedings{ cohnumans2, author = {Henry Cohn and Robert D. Kleinberg and Bal{\'a}zs Szegedy and Christopher Umans}, title = {Group-theoretic Algorithms for Matrix Multiplication}, crossref = {pfocs05}, pages = {379--388}, doi = {10.1109/SFCS.2005.39} } @Article{ cw90, author = {Don Coppersmith and Shmuel Winograd}, title = {Matrix Multiplication via Arithmetic Progressions}, journal = jsymboliccomput, volume = {9}, number = {3}, year = {1990}, pages = {251--280}, doi = {10.1016/S0747-7171(08)80013-2} } @Article{ dor, author = {Dorit Dor and Shay Halperin and Uri Zwick}, title = {All-Pairs Almost Shortest Paths}, journal = siamjcomput, volume = {29}, number = {5}, year = {2000}, pages = {1740--1759}, note = { Preliminary version in FOCS'96}, doi = {10.1137/S0097539797327908} } @Article{ duke, author = {Richard A. Duke and Hanno Lefmann and Vojtech R{\"o}dl}, title = {A Fast Approximation Algorithm for Computing the Frequencies of Subgraphs in a Given Graph}, journal = siamjcomput, volume = {24}, number = {3}, year = {1995}, pages = {598--620}, doi = {10.1137/S0097539793247634} } @InProceedings{ elkin, author = {Michael Elkin}, title = {An Improved Construction of Progression-Free Sets}, booktitle = soda10, year = {2010}, pages = {886--905} } @Article{ federmotwani, author = {Tom{\'a}s Feder and Rajeev Motwani}, title = {Clique Partitions, Graph Compression and Speeding-Up Algorithms}, journal = jcomputsystemsci, volume = {51}, number = {2}, year = {1995}, pages = {261--272}, doi = {10.1006/jcss.1995.1065}, note = { Preliminary version in STOC'91} } @InProceedings{ fischermeyer, author = {Michael J. Fischer and Albert R. Meyer}, title = {{B}oolean Matrix Multiplication and Transitive Closure}, booktitle = focs71, year = 1971, publisher = ieee, pages = {129--131}, doi = {10.1109/SWAT.1971.4} } @InProceedings{ fkfocs, author = {Alan M. Frieze and Ravi Kannan}, title = {The {R}egularity {L}emma and Approximation Schemes for Dense Problems}, crossref = {pfocs96}, year = {1996}, pages = {12--20}, doi = {10.1109/SFCS.1996.548459} } @Article{ fk, author = {Alan M. Frieze and Ravi Kannan}, title = {Quick Approximation to Matrices and Applications}, journal = {Combinatorica}, volume = {19}, number = {2}, year = {1999}, pages = {175--220}, doi = {10.1007/s004930050052} } @Article{ fksimple, author = { Alan Frieze and Ravi Kannan}, title = { A simple algorithm for constructing {S}zemer{\'e}di's regularity partition}, journal = { Electr. J. Comb.}, volume = { 6}, year = {1999}, url = {http://www.combinatorics.org/ojs/index.php/eljc/article/view/v6i1r17} } @Article{ galilmargalit, author = { Zvi Galil and Oded Margalit}, title = { All pairs shortest distances for graphs with small integer length edges}, journal = informandcomput, volume = {134}, pages = {103--139}, year = {1997}, doi = {10.1006/inco.1997.2620} } @Article{ go95, author = {Anka Gajentaan and Mark H. Overmars}, title = {On a class of $O(n^2)$ problems in computational geometry}, journal = {Computational Geometry}, volume = { 5}, pages = {165--185}, year = {1995}, doi = {10.1016/0925-7721(95)00022-2} } @Article{ green, author = { Ben Green}, title = { A {S}zemer{\'e}di-type regularity lemma in abelian groups}, journal = { Geom. and Funct. Anal.}, volume = { 15}, issue = {2}, pages = {340--376}, year = { 2005}, doi = {10.1007/s00039-005-0509-8} } @Article{ gowers, author = { W. T. Gowers}, title = { Lower bounds of tower type for {S}zemer\'{e}di's uniformity lemma}, journal = { Geom. and Funct. Anal.}, volume = {7}, issue = {2}, pages = {322--337}, year = { 1997}, doi = {10.1007/PL00001621} } @InProceedings{ hmt, author = {Andr{\'a}s Hajnal and Wolfgang Maass and Gy{\"o}rgy Tur{\'a}n}, title = {On the Communication Complexity of Graph Properties}, crossref = {pstoc88}, pages = {186--191}, doi = {10.1145/62212.62228} } @Article{ clique1, author = {Alon Itai and Michael Rodeh}, title = {Finding a Minimum Circuit in a Graph}, journal = siamjcomput, volume = {7}, number = {4}, year = {1978}, pages = {413--423}, doi = {10.1137/0207033} } @InCollection{ kohayakawa2, author = {Y. Kohayakawa}, title = {{Szemer\'{e}di's} regularity lemma for sparse graphs}, booktitle = {Foundations of Computational Mathematics}, editor = {F. Cucker and M. Shub}, pages = {216--230}, publisher = springer, year = {1997} } @Article{ kohayakawa, author = {Yoshiharu Kohayakawa and Vojtech R{\"o}dl and Lubos Thoma}, title = {An Optimal Algorithm for Checking Regularity}, journal = siamjcomput, volume = {32}, number = {5}, year = {2003}, pages = {1210--1235}, doi = {10.1137/S0097539702408223} } @InProceedings{ komlos, author = { J\'{a}nos Koml\'{o}s and Mikl\'{o}s Simonovits}, title = { {S}zemer\'{e}di's {R}egularity {L}emma and its applications in graph theory}, booktitle = { Combinatorics, Paul Erd{\H o}s is Eighty, (D. Mikl{\'o}s et. al, eds.), Bolyai Society Mathematical Studies}, volume = {2}, pages = {295--352}, year = {1996} } @Article{ lee, author = { Lillian Lee}, title = { Fast context-free grammar parsing requires fast {B}oolean matrix multiplication}, journal = jacm, volume = { 49}, issue = {1}, pages = {1--15}, year = { 2002}, doi = {10.1145/505241.505242} } @InProceedings{ lingas, author = {Andrzej Lingas}, title = {A Geometric Approach to {B}oolean Matrix Multiplication}, booktitle = {Proc. 13th Int. Symp. on Algorithms and Computation (ISAAC'02)}, year = {2002}, pages = {501--510}, doi = {10.1007/3-540-36136-7\_44} } @Article{ ls, author = { L\'{a}szl\'{o} Lov{\'a}sz and Bal\'{a}zs Szegedy}, title = { {S}zemer\'{e}di's theorem for the analyst}, journal = { Geom. and Funct. Anal.}, volume = {17}, number = {1}, pages = {252--270}, year = {2007}, doi = {10.1007/s00039-007-0599-6} } @Article{ mm, author = { J. W. Moon and L. Moser}, title = { A Matrix Reduction Problem}, journal = { Mathematics of Computation}, volume = { 20}, issue = {94}, pages = {328--330}, year = { 1966}, doi = {10.1090/S0025-5718-66-99935-2} } @Article{ oneil, author = { Patrick E. O'Neil and Elizabeth J. O'Neil}, title = { A fast expected time algorithm for {B}oolean matrix multiplication and transitive closure matrices}, journal = infcont, volume = { 22}, issue = {2}, pages = {132--138}, year = { 1973}, doi = {10.1016/S0019-9958(73)90228-3} } @Book{ pan, author = {Victor Y. Pan}, title = {How to Multiply Matrices Faster}, publisher = {Springer}, series = {Lecture Notes in Computer Science}, volume = {179}, year = {1984} } @InProceedings{ patrascu10, author = {Mihai Patrascu}, title = {Towards polynomial lower bounds for dynamic problems}, crossref = {pstoc10}, pages = {603--610}, doi = {10.1145/1806689.1806772} } @Article{ rodittyzwick, author = {Liam Roditty and Uri Zwick}, title = {On Dynamic Shortest Paths Problems}, journal = algorithmica, volume = {61}, number = {2}, pages = {389--401}, year = {2010}, doi = {10.1007/s00453-010-9401-5}, note = {Preliminary version in 12th Europ. Symp. Algor. (ESA'04)} } @InProceedings{ rs, author = { Vojt{\v e}ch R{\"o}dl and Mathias Schacht}, title = { Property testing in hypergraphs and the removal lemma}, crossref = {pstoc07}, pages = {488--495}, doi = {10.1145/1250790.1250862} } @Article{ ruzsasz, author = { I. Z. Ruzsa and E. Szemer\'{e}di}, title = { Triple systems with no six points carrying three triangles}, journal = { Colloquia Mathematica Societatis J\'{a}nos Bolyai}, volume = {18}, pages = {939--945}, year = {1978} } @Article{ r85, author = { Wojciech Rytter}, title = { Fast recognition of pushdown automaton and context-free languages}, journal = infcont, volume = { 67}, issue = {1-3}, pages = {12--22}, year = { 1985}, note = { Preliminary version in MFCS'84}, doi = {10.1016/S0019-9958(85)80024-3} } @Article{ s74, author = {John E. Savage}, title = {An algorithm for the computation of linear forms}, journal = siamjcomput, volume = {3}, issue = {2}, pages = {150--158}, year = {1974}, doi = {10.1137/0203011} } @InProceedings{ schnorrsub, author = { C.-P. Schnorr and C. R. Subramanian}, title = { Almost optimal (on the average) combinatorial algorithms for {B}oolean matrix product witnesses, computing the diameter}, booktitle = {Proc. 2nd Intern. Workshop Random. and Approx. Tech. Comput. Sci. (RANDOM'98)}, pages = { 218--231}, year = { 1998}, doi = {10.1007/3-540-49543-6\_18} } @Article{ seidel, author = { Raimund Seidel}, title = { On the all-pairs-shortest-path problem in unweighted undirected graphs}, journal = jcomputsystemsci, volume = { 51}, number = {3}, pages = {400--403}, year = { 1995}, doi = {10.1006/jcss.1995.1078} } @InProceedings{ shapira, author = {Asaf Shapira}, title = { {G}reen's conjecture and testing linear-invariant properties}, crossref = {pstoc09}, pages = {159--166}, doi = {10.1145/1536414.1536438} } @InProceedings{ shoshanzwick, author = { Avi Shoshan and Uri Zwick}, title = { All pairs shortest paths in undirected graphs with integer weights}, crossref = {pfocs99}, pages = { 605--614}, doi = {10.1109/SFFCS.1999.814635} } @Article{ strassen, author = {Volker Strassen}, title = {{G}aussian elimination is not optimal}, journal = {Numerische Mathematik}, volume = {13}, number = {4}, pages = {354--356}, year = {1969}, doi = {10.1007/BF02165411} } @InProceedings{ sz, title = "Regular partitions of graphs", author = "Endre 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 } @InProceedings{ trevisan, author = { Luca Trevisan}, title = {Additive Combinatorics and Theoretical Computer Science}, booktitle = { SIGACT News Complexity Column 63}, year = { 2009} } @Article{ valiant, author = {Leslie G. Valiant}, title = {General Context-Free Recognition in Less than Cubic Time}, journal = jcomputsystemsci, volume = {10}, number = {2}, year = {1975}, pages = {308--315}, doi = {10.1016/S0022-0000(75)80046-8} } @InProceedings{ soda07, author = {Ryan Williams}, title = {Matrix-vector multiplication in sub-quadratic time (some preprocessing required)}, crossref = {psoda07}, pages = {995--1001} } @Proceedings{ pstoc88, booktitle = stoc88, year = 1988, publisher = acm } @Proceedings{ pstoc06, booktitle = stoc06, year = 2006, publisher = acm } @Proceedings{ pstoc07, booktitle = stoc07, year = 2007, publisher = acm } @Proceedings{ pstoc09, booktitle = stoc09, year = 2009, publisher = acm } @Proceedings{ pstoc10, booktitle = stoc10, year = 2010, publisher = acm } @Proceedings{ pfocs96, booktitle = focs96, year = 1996, publisher = ieee } @Proceedings{ pfocs99, booktitle = focs99, year = 1999, publisher = ieee } @Proceedings{ pfocs03, booktitle = focs03, year = 2003, publisher = ieee } @Proceedings{ pfocs05, booktitle = focs05, year = 2005, publisher = ieee } @Proceedings{ pfocs10, booktitle = focs10, year = 2010, publisher = ieee } @Proceedings{ psoda07, booktitle = soda07, year = 2007, publisher = acm } %%%%%%%%%%%%%%%%%%%%%%%%%% %%%%% bib of v008a005 %%%%%%%%%%%%%%%%%%%%%%%%%% @STRING{acm = "ACM Press" } @STRING{ec06 = {Proc. 7th ACM Conf. on Electronic Commerce} } @STRING{ec07 = {Proc. 8th ACM Conf. on Electronic Commerce} } @STRING{ec09 = {Proc. 10th ACM Conf. on Electronic Commerce} } @STRING{focs05 = "Proc. 46th FOCS" } @STRING{ieee = "IEEE Comp. Soc. Press" } @STRING{ieeetransinformtheory="IEEE Trans. Inform. Theory" } @STRING{lncs = "LNCS" } @STRING{mathoperres="Math. Oper. Res." } @STRING{mathprogram="Math. Program." } @STRING{siamjcomput="SIAM J. Comput." } @string{soda=" Ann. ACM-SIAM Symp. on Discrete Algorithms"} @STRING{soda07 = "Proc. 18th" # soda # " (SODA'07)" } @STRING{soda08 = "Proc. 19th" # soda # " (SODA'08)" } @STRING{soda09 = "Proc. 20th" # soda # " (SODA'09)" } @STRING{springer= "Springer" } @string{stacs=" Symp. Theoretical Aspects of Comp. Sci."} @STRING{stacs03 = "Proc. 20th" # stacs # " (STACS'03)" } @STRING{stoc08 = "Proc. 40th STOC" } @Book{ welsh, author = {D. J. A. Welsh}, title = {Matroid Theory}, publisher = {Academic Press}, year = 1976 } @Book{ gj79, author = "Michael R. Garey and David S. Johnson", title = "Computers and Intractability: A Guide to the Theory of {NP}-Completeness", publisher = "Freeman", year = 1979 } @Book{ jasonbook, author = "Jason D. Hartline", title = "Approximation in Economic Design", year = 2011, note = "Book in preparation. \url{http://www.eecs.northwestern.edu/hartline}", url = {http://www.eecs.northwestern.edu/hartline} } @Book{ milgrom, title = {Putting Auction Theory to Work}, author = {Paul R. Milgrom}, year = 2004, publisher = {Cambridge University Press}, note = {\url{http://econpapers.repec.org/RePEc:cup:cbooks:9780521536721}} , url = {http://econpapers.repec.org/RePEc:cup:cbooks:9780521536721} } @Book{ oxley, author = {James Oxley}, title = {Matroid Theory}, publisher = {Oxford}, year = 1992 } @Article{ myerson81, author = {Roger B. Myerson}, journal = mathoperres, keywords = {auction design}, number = {1}, pages = {58--73}, title = {Optimal auction design}, volume = {6}, year = {1981}, doi = {10.1287/moor.6.1.58} } @Article{ hv06, author = {Hal R. Varian}, journal = {Internat. J. of Industrial Organization}, title = {Position Auctions}, year = 2007, volume = 25, number = 6, pages = "1163--1178", doi = "10.1016/j.ijindorg.2006.10.002" } @Article{ eos07, author = {Benjamin Edelman and Michael Ostrovsky and Michael Schwarz}, journal = {American Economic Review}, title = {Internet Advertising and the Generalized Second Price Auction: Selling Billions of Dollars Worth of Keywords}, year = {2007}, volume = {97}, number = 1, pages = {242--259}, doi = {10.1257/aer.97.1.242} } @InProceedings{ agm06, author = {Gagan Aggarwal and Ashish Goel and Rajeev Motwani}, title = {Truthful auctions for pricing search keywords}, booktitle = ec06, year = {2006}, pages = {1--7}, doi = {10.1145/1134707.1134708}, publisher = acm } @Article{ bk96, author = {Jeremy Bulow and Paul Klemperer}, title = {Auctions versus Negotiations}, journal = {American Economic Review}, year = 1996, volume = {86}, number = {1}, pages = {180-94}, month = {March} } @Article{ n03, author = {Neeman, Zvika}, title = {The effectiveness of {E}nglish auctions}, journal = {Games and Economic Behavior}, year = 2003, volume = {43}, number = {2}, pages = {214-238}, doi = {10.1016/S0899-8256(03)00005-8} } @InProceedings{ vohra08, author = {Bikhchandani, Sushil and de Vries, Sven and Schummer, James and Vohra, Rakesh V.}, title = {Ascending auctions for integral (poly)matroids with concave nondecreasing separable values}, crossref = {psoda08}, pages = {864--873}, note = {\href{http://dl.acm.org/citation.cfm?id=1347177}{ [ACM DL] }}, } @InProceedings{ hartline08, author = {Cary, Matthew C. and Flaxman, Abraham D. and Hartline, Jason D. and Karlin, Anna R.}, title = {Auctions for structured procurement}, crossref = {psoda08}, pages = {304--313}, note = {\href{http://portal.acm.org/citation.cfm?id=1347116}{ [ACM DL] }}, } @InProceedings{ bim07, author = {Babaioff, Moshe and Immorlica, Nicole and Kleinberg, Robert D.}, title = {Matroids, secretary problems, and online mechanisms}, crossref = {psoda07}, year = {2007}, pages = {434--443}, note = {\href{http://portal.acm.org/citation.cfm?id=1283429}{ [ACM DL] }}, } @InProceedings{ talwar03, author = {Talwar, Kunal}, title = {The Price of Truth: Frugality in Truthful Mechanisms}, booktitle = stacs03, series = lncs, volume = 2607, publisher = springer, year = {2003}, pages = {608--619} } @Article{ vardy97, title = {The intractability of computing the minimum distance of a code}, author = {Vardy, Alexander}, journal = ieeetransinformtheory, year = {1997}, volume = {43}, number = {6}, pages = {1757-1766}, doi = {10.1109/18.641542} } @InProceedings{ kkt05, author = {Karlin, Anna R. and Kempe, David and Tamir, Tami}, title = {Beyond {VCG}: Frugality of Truthful Mechanisms}, crossref = {pfocs05}, pages = {615--626}, doi = {10.1109/SFCS.2005.25} } @Unpublished{ frugal, author = "Jason D. Hartline", title = "Lectures on Frugal Mechanism Design", year = "2008", note = "EECS 510 Lecture Notes. \url{http://users.eecs.northwestern.edu/~hartline/frugality.ps}" , url = "http://users.eecs.northwestern.edu/~hartline/frugality.ps" } @Article{ fmv11, author = {Feige, Uri and Mirrokni, Vahab S. and {Vondr\'{a}k}, Jan}, title = {Maximizing Non-Monotone Submodular Functions}, journal = siamjcomput, volume = 40, number = 4, year = 2011, pages = {1133-1153}, doi = {10.1137/090779346} } @Article{ nwf, author = {G. L. Nemhauser and L. A. Wolsey and M. L. Fisher}, journal = mathprogram, pages = {265--294}, title = {An analysis of approximations for maximizing submodular set functions -- {I}.}, volume = {14}, number = 3, year = {1978}, doi = {10.1007/BF01588971} } @InProceedings{ ls07, author = {Lambert, Nicolas S. and Shoham, Yoav}, title = {Asymptotically optimal repeated auctions for sponsored search}, booktitle = ec07, year = {2007}, pages = {55--64}, doi = {10.1145/1282100.1282112} } @InProceedings{ hr09, author = {Hartline, Jason D. and Roughgarden, Tim}, title = {Simple versus optimal mechanisms}, booktitle = ec09, year = {2009}, pages = {225--234}, doi = {10.1145/1566374.1566407} } @Unpublished{ sg08, author = {Pranava R. Goundan and Andreas S. Schulz}, title = {Revisiting the Greedy Approach to Submodular Set Function Maximization}, note = {Preprint, 2009} } @Article{ rastegari07, author = {Rastegari, Baharak and Condon, Anne and Leyton-Brown, Kevin}, title = {Revenue monotonicity in combinatorial auctions}, journal = {SIGecom Exchanges}, volume = {7}, number = {1}, year = {2007}, pages = {45--47}, doi = {10.1145/1345037.1345048} } @InProceedings{ constantin2009, author = {Constantin, Florin and Feldman, Jon and Muthukrishnan, S. Muthu and P\'{a}l, Martin}, title = {An online mechanism for ad slot reservations with cancellations}, crossref = {psoda09}, pages = {1265--1274}, note = {\href{http://www.siam.org/proceedings/soda/2009/SODA09_137_constantinf.pdf}{ [SODA PDF] }}, } @Book{ kozen, isbn = "3-540-97687-6", address = "New York", author = "Dexter C. Kozen", title = "The Design and Analysis of Algorithms", publisher = "Springer-Verlag", year = "1991" } @Article{ es10, author = {Benjamin Edelman and Michael Schwarz}, title = {Optimal Auction Design and Equilibrium Selection in Sponsored Search Auctions}, journal = {American Economic Review}, year = 2010, volume = {100}, number = {2}, pages = {597-602}, doi = {10.1257/aer.100.2.597} } @InProceedings{ vondrak_stoc08, author = {{Vondr\'{a}k}, Jan}, title = {Optimal approximation for the submodular welfare problem in the value oracle model}, crossref = {pstoc08}, pages = {67--74}, doi = {10.1145/1374376.1374389} } @Article{ k2006, author = {Ren\'{e} Kirkegaard}, title = {A short proof of the {B}ulow-{K}lemperer auctions {vs.\ } negotiations result}, journal = {Economic Theory}, year = 2006, volume = {28}, number = {2}, pages = {449-452}, doi = {10.1007/s00199-004-0593-2} } @Article{ am2002, title = {Ascending Auctions with Package Bidding}, author = {Ausubel, Lawrence M. and Milgrom, Paul R.}, year = {2002}, journal = "Frontiers of Theoretical Economics", volume = 1, number = 1, note = "Article 1" } @Proceedings{ pstoc08, booktitle = stoc08, year = 2008, publisher = acm } @Proceedings{ pfocs05, booktitle = focs05, year = 2005, publisher = ieee } @Proceedings{ psoda07, booktitle = soda07, year = 2007, publisher = acm } @Proceedings{ psoda08, booktitle = soda08, year = 2008, publisher = acm } @Proceedings{ psoda09, booktitle = soda09, year = 2009, publisher = acm } %%%%%%%%%%%%%%%%%%%%%%%%%% %%%%% bib of v008a006 %%%%%%%%%%%%%%%%%%%%%%%%%% @STRING{esa = " Ann. Europ. Symp. on Algorithms" } @STRING{icml = " Int. Conf. on Machine Learning" } @STRING{latin = " Latin Amer. Symp. on Theoretical Informatics" } @STRING{soda = " Ann. ACM-SIAM Symp. on Discrete Algorithms" } @STRING{acm = "ACM Press" } @STRING{acmtransalgorithms="ACM Trans. Algorithms" } @STRING{discretecomputgeom="Discrete Comput. Geom." } @STRING{eccc = "Electron. Colloq. on Comput. Complexity (ECCC)" } @STRING{esa04 = "Proc. 12th" # esa # " (ESA'04)" } @STRING{focs05 = "Proc. 46th FOCS" } @STRING{focs82 = "Proc. 23rd FOCS" } @STRING{focs88 = "Proc. 29th FOCS" } @STRING{focs95 = "Proc. 36th FOCS" } @STRING{focs96 = "Proc. 37th FOCS" } @STRING{focs98 = "Proc. 39th FOCS" } @STRING{icml03 = "Proc. 20th" # icml # " (ICML'03)" } @STRING{ieee = "IEEE Comp. Soc. Press" } @STRING{informandcomput="Inform. and Comput." } @STRING{jacm = "J. ACM" } @STRING{jams = "J. Amer. Math. Soc." } @STRING{jcss = "J. Comput. System Sci." } @STRING{jmathphys="J. Math. Phys." } @STRING{latin08 = " Proc. 8th" # latin # " (LATIN'08)" } @STRING{mathoperres="Math. Oper. Res." } @STRING{siamjcomput="SIAM J. Comput." } @STRING{soda09 = "Proc. 20th" # soda # " (SODA'09)" } @STRING{soda95 = "Proc. 6th" # soda # " (SODA'95)" } @STRING{stoc07 = "Proc. 39th STOC" } @STRING{stoc93 = "Proc. 25th STOC" } @STRING{stoc96 = "Proc. 28th STOC" } @string{ipco99= "Proc. 7th Conf. on Integer Programming and Combinatorial Optimization (IPCO'99)"} @InCollection{ brown51, author = {George W. Brown}, title = {Iterative solution of games by fictitious play}, booktitle = {Analysis of Production and Allocation}, editor = {T. C. Koopmans}, publisher = {Wiley}, year = {1951}, pages = {374--376}, doi = {} } @Article{ bvn, author = {George W. Brown and John von Neumann}, title = {Solutions of games by differential equations}, journal = {Annals of Mathematics Studies}, year = {1950}, volume = {24}, publisher = {Princeton Univ. Press}, pages = {73--79}, doi = {} } @Book{ chazelle00, author = "Bernard Chazelle", title = "The Discrepancy Method---Randomness and Complexity", pages = "xvii, 463", year = "2000", publisher = "Cambridge University Press", address = "Cambridge", doi = {10.1007/3-540-49381-6\_1} } @Article{ chawel89, author = "Bernard Chazelle and Emo Welzl", title = "Quasi-Optimal Range Searching in Spaces of Finite {VC}-Dimension", journal = discretecomputgeom, volume = "4", year = "1989", pages = "467--489", doi = {10.1007/BF02187743} } @Article{ feigesetcover, author = "Uriel Feige", title = "A threshold of $\ln n$ for approximating set cover", journal = jacm, volume = "45", number = "4", pages = "634--652", month = "July", year = "1998", doi = {10.1145/285055.285059} } @InProceedings{ gk, author = "Naveen Garg and Jochen K{\"o}nemann", title = "Faster and Simpler Algorithms for Multicommodity Flow and Other Fractional Packing Problems", pages = "300--309", crossref = {pfocs98}, doi = {10.1109/SFCS.1998.743463} } @Article{ gk2, author = "Naveen Garg and Jochen K{\"o}nemann", title = "Faster and Simpler Algorithms for Multicommodity Flow and Other Fractional Packing Problems", journal = siamjcomput, volume = 37, issue = 2, pages = "630--652", year = "2007", doi = {10.1137/S0097539704446232} } @Article{ helmbold, author = {David P. Helmbold and Robert E. Schapire and Yoram Singer and Manfred K. Warmuth}, title = {On-Line Portfolio Selection Using Multiplicative Updates}, journal = {Mathematical Finance}, year = {1998}, volume = {8}, issue = {4}, pages = {325--347}, note = {Preliminary version in 13th Int. Conf. on Machine Learning (ICML'96)}, doi = {10.1111/1467-9965.00058} } @Article{ pst, author = "Serge A. Plotkin and David B. Shmoys and {\'E}va Tardos", title = "Fast approximation algorithm for fractional packing and covering problems", journal = mathoperres, volume = 20, issue = 2, pages = "257--301", year = "1995", note = "Preliminary version in FOCS'91", doi = {10.1287/moor.20.2.257} } @Article{ lw, title = "The Weighted Majority Algorithm", author = "Nick Littlestone and Manfred K. Warmuth", pages = "212--261", journal = informandcomput, year = "1994", volume = "108", number = "2", doi = {10.1006/inco.1994.1009} } @Article{ schapire90, author = {Robert E. Schapire}, title = {The Strength of Weak Learnability}, journal = {Machine Learning}, volume = {5}, year = {1990}, pages = {197--227}, doi = {10.1007/BF00116037} } @Article{ fsadaboost, author = "Yoav Freund and Robert E. Schapire", title = "A decision-theoretic generalization of on-line learning and an application to boosting", year = "1997", journal = jcss, number = "1", pages = "119--139", volume = "55", doi = {10.1006/jcss.1997.1504} } @InProceedings{ youngrounding, title = "Randomized Rounding Without Solving the Linear Program", author = "Neal E. Young", pages = "170--178", crossref = {psoda95}, note = {\href{http://dl.acm.org/citation.cfm?id=313689}{[ACM DL]}}, doi = {} } @InProceedings{ ixor, title = "Hard-core distributions for somewhat hard problems", author = "Russell Impagliazzo", pages = "538--545", crossref = {pfocs95}, doi = {10.1109/SFCS.1995.492584} } @Article{ ks, author = "Adam R. Klivans and Rocco A. Servedio", title = "Boosting and Hard-Core Set Construction", journal = "Machine Learning", volume = "51", number = "3", year = "2003", pages = "217--238", publisher = "Kluwer Academic Publishers", doi = {10.1023/A:1022949332276} } @Article{ fleischer, author = {Lisa K. Fleischer}, title = {Approximating Fractional Multicommodity Flow Independent of the Number of Commodities}, journal = {SIAM Journal of Discrete Mathematics}, volume = {13}, number = {4}, year = {2000}, pages = {505--520}, note = {Preliminary version in FOCS'99}, doi = {10.1137/S0895480199355754} } @Article{ fsgames, author = "Yoav Freund and Robert E. Schapire", title = "Adaptive Game Playing Using Multiplicative Weights", journal = "Games and Economic Behavior", year = "1999", volume = "29", pages = "79--103", doi = {10.1006/game.1999.0738} } @InProceedings{ kleinlu, author = "Philip N. Klein and Hsueh-I Lu", title = "Efficient approximation algorithms for semidefinite programs arising from {MAX CUT} and {COLORING}", crossref = {pstoc96}, pages = "338--347", year = "1996", doi = {10.1145/237814.237980} } @inproceedings{KleinYoung, author = {Philip N. Klein and Neal Young}, title = {On the Number of Iterations for {D}antzig-{W}olfe Optimization and Packing-Covering Approximation Algorithms}, booktitle = ipco99, series = {LNCS 1610}, year = {1999}, pages = {320-327}, publisher = {Springer}, note = {\href{http://dl.acm.org/citation.cfm?id=645589.659777}{[ACM DL]}}, } @Article{ raghavan, author = "Prabhakar Raghavan", title = "Probabilistic Construction of Deterministic Algorithms: Approximating Packing Integer Programs", journal = jcss, year = "1988", volume = 37, issue = 2, pages = "130--143", note = "Preliminary version in FOCS'86", doi = {10.1016/0022-0000(88)90003-7} } @Article{ raghavan-thompson, author = "Prabhakar Raghavan and Clark D. Thompson", title = "Randomized rounding: {A} technique for provably good algorithms and algorithmic proofs", journal = "Combinatorica", pages = "365--374", year = 1987, number = 4, volume = 7, doi = {10.1007/BF02579324} } @Article{ gw, author = {Michel X. Goemans and David P. Williamson}, title = {Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming}, journal = jacm, volume = {42}, number = {6}, year = {1995}, issn = {0004-5411}, pages = {1115--1145}, doi = {10.1145/227683.227684} } @Article{ robinson51, author = {Julia Robinson}, title = {An iterative method of solving a game}, journal = {Annals of Mathematics}, year = {1951}, volume = {54}, pages = {296--301}, doi = {10.2307/1969530} } @Article{ fostervohra, author = {Dean P. Foster and Rakesh Vohra}, title = {Regret in the On-Line Decision Problem}, journal = {Games and Economic Behaviour}, year = {1999}, volume = {29}, pages = {7--35}, doi = {10.1006/game.1999.0740} } @InProceedings{ cover96, title = "Universal Data Compression and Portfolio Selection", author = "Thomas M. Cover", pages = "534--538", crossref = {pfocs96}, doi = {10.1109/SFCS.1996.548512} } @InProceedings{ yao82, title = "Theory and Applications of Trapdoor Functions (Extended Abstract)", author = "Andrew C. Yao", pages = "80--91", crossref = {pfocs82}, year = "1982", doi = {10.1109/SFCS.1982.88} } @InCollection{ hannan, author = "James Hannan", title = "Approximation to {B}ayes risk in repeated plays", editor = "M. Dresher and A. W. Tucker and P. Wolfe", booktitle = "Contributions to the Theory of Games", publisher = "Princeton University Press", volume = "3", pages = "97--139", year = "1957", doi = {} } @Article{ kalaivempala, author = {Adam Kalai and Santosh Vempala}, title = {Efficient Algorithms for Online Decision Problems}, journal = jcss, year = {2005}, volume = {71}, issue = {3}, pages = {291--307}, note = {Preliminary version in 16th COLT (2003)}, doi = {10.1016/j.jcss.2004.10.016} } @PhDThesis{ khandekarphd, author = {Rohit Khandekar}, title = {Lagrangian Relaxation based Algorithms for Convex Programming Problems}, school = {Indian Institute of Technology, Delhi}, year = {2004}, doi = {} } @InProceedings{ blum-survey, author = "Avrim Blum", title = "On-line Algorithms in Machine Learning", editor = "A. Fiat and G. Woeginger", booktitle = "Online Algorithms: The State of the Art", publisher = "LNCS 1442", pages = "306--325", year = "1998", doi = {10.1007/BFb0029575} } @Article{ bronnimann, author = "H. Br{\"o}nnimann and M.T. Goodrich", title = {Almost Optimal Set Covers in Finite {VC}-Dimension}, journal = discretecomputgeom, volume = "14", pages = "463--479", year = "1995", note = "Preliminary version in 10th Ann. Symp. Comp. Geom. (SCG'94)", doi = {10.1007/BF02570718} } @InProceedings{ clarkson, author = "Kenneth L. Clarkson", title = "A {L}as {V}egas Algorithm for linear programming when the dimension is small", crossref = {pfocs88}, pages = "452--456", doi = {10.1109/SFCS.1988.21961} } @Article{ clarkson2, author = "Kenneth L. Clarkson", title = "A {L}as {V}egas Algorithm for linear and integer programming when the dimension is small", journal = jacm, volume = 42, issue = 2, pages = "488--499", year = "1995", doi = {10.1145/201019.201036} } @Article{ cgr, author = "Suchi Chawla and Anupam Gupta and Harald R{\"a}cke", title = "Embeddings of Negative-Type Metrics and an Improved Approximation to Generalized Sparsest Cut", journal = acmtransalgorithms, year = "2008", volume = 4, issue = 2, article = 22, pages = "22:1--22:18", note = "Preliminary version in SODA'05", doi = {10.1145/1361192.1361199} } @Article{ arv, author = "Sanjeev Arora and Satish Rao and Umesh Vazirani", title = "Expander flows, geometric embeddings, and graph partitioning", journal = jacm, volume = "56", number = "2", article = "5", year = "2009", note = "Preliminary version in 36th STOC (2004)", pages = "5:1--5:37", doi = {10.1145/1502793.1502794} } @Article{ aln, author = "Sanjeev Arora and James R. Lee and Assaf Naor", title = "Euclidean distortion and the sparsest cut", journal = jams, volume = 21, year = "2008", pages = "1--21", note = "Preliminary version in STOC'05", doi = {10.1090/S0894-0347-07-00573-5} } @Article{ grigoriadis-kachiyan, author = "Michael D. Grigoriadis and Leonid G. Khachiyan", title = "A sublinear-time randomized approximation algorithm for matrix games", journal = "Operations Research Letters", volume = "18", issue = 2, pages = "53--58", year = "1995", doi = {10.1016/0167-6377(95)00032-0} } @InProceedings{ zinkevich, author = {Martin Zinkevich}, title = {Online Convex Programming and Generalized Infinitesimal Gradient Ascent}, booktitle = icml03, year = {2003}, pages = {928--936}, doi = {} } @PhDThesis{ eladthesis, author = {Elad Hazan}, title = {Efficient Algorithms for Online Convex Optimization and their Applications}, note = {Technical Report TR-766-06}, school = {Princeton University}, year = {2006}, doi = {} } @PhDThesis{ satyenthesis, author = {Satyen Kale}, title = {Efficient Algorithms Using The Multiplicative Weights Update Method}, note = {Technical Report TR-804-07}, school = {Princeton University}, year = {2006}, doi = {} } @TechReport{ satyen-hard-core, author = {Satyen Kale}, title = {Boosting and hard-core set constructions: {A} simplified approach}, institution = eccc, number = {TR07-131}, eprint = {eccc:TR07-131}, year = {2007}, doi = {} } @Article{ ahkcut, author = {Sanjeev Arora and Elad Hazan and Satyen Kale}, title = {${O}(\sqrt{\log n})$ Approximation to {SPARSEST CUT} in $\tilde{O}(n^2)$ Time}, journal = siamjcomput, year = {2010}, volume = 39, issue = 5, pages = {1748--1771}, note = "Preliminary version in FOCS'04", doi = {10.1137/080731049} } @InProceedings{ ahksdp, author = {Sanjeev Arora and Elad Hazan and Satyen Kale}, title = {Fast Algorithms for Approximate Semidefinite Programming using the Multiplicative Weights Update Method}, crossref = {pfocs05}, year = {2005}, pages = {339--348}, doi = {10.1109/SFCS.2005.35} } @Book{ cesabianchilugosi06book, author = {Nicol{\`o} Cesa-Bianchi and G{\'a}bor Lugosi}, title = {Prediction, Learning, and Games}, publisher = {Cambridge University Press}, year = {2006}, owner = {cusgadmin}, timestamp = {2006.10.17}, doi = {10.1017/CBO9780511546921} } @Article{ hak, author = {Elad Hazan and A. Agarwal and Satyen Kale}, title = {Logarithmic Regret Algorithms for Online Convex Optimization}, journal = {Machine Learning}, year = {2007}, volume = {69}, number = {2-3}, pages = {169--192}, doi = {10.1007/s10994-007-5016-8} } @Article{ littlestonewinnow1, author = {Nick Littlestone}, title = {Learning Quickly When Irrelevant Attributes Abound: A New Linear-threshold Algorithm}, journal = {Machine Learning}, volume = {2}, number = {4}, year = {1987}, pages = {285--318}, note = "Preliminary version in FOCS'87", doi = {10.1007/BF00116827} } @PhDThesis{ littlestonewinnow2, author = {Nick Littlestone}, title = {Mistake bounds and logarithmic linear-threshold learning algorithms}, year = {1989}, school = {University of California at Santa Cruz}, address = {Santa Cruz, CA, USA}, doi = {} } @InProceedings{ benczur, author = {Andr{\'a}s A. Bencz{\'u}r and David R. Karger}, title = {Approximating {$s-t$} Minimum Cuts in $\tilde{O}(n^2)$ Time}, crossref = {pstoc96}, year = {1996}, pages = {47--55}, doi = {10.1145/237814.237827} } @InProceedings{ ak, author = {Sanjeev Arora and Satyen Kale}, title = {A Combinatorial, Primal-Dual approach to Semidefinite Programs}, crossref = {pstoc07}, pages = {227--236}, doi = {10.1145/1250790.1250823} } @Book{ minskypapert, author = {M. Minsky and S. Papert}, title = {Perceptrons}, publisher = {MIT Press}, year = {1969}, doi = {} } @InProceedings{ gkhand, author = {Naveen Garg and Rohit Khandekar}, title = {Fractional Covering with Upper Bounds on the Variables: Solving {LPs} with Negative Entries}, booktitle = esa04, year = {2004}, pages = {371--382}, doi = {10.1007/978-3-540-30140-0\_34} } @Article{ warkuz, author = {Manfred K. Warmuth and Dima Kuzmin}, title = {Online variance minimization}, journal = {Machine Learning}, volume = 87, issue = 1, pages = "1--32", year = {2012}, note = "Preliminary version in COLT'06", doi = {10.1007/s10994-011-5269-0} } @Misc{ kalainote, author = {Adam Kalai}, title = {Personal communication with {Manfred} {Warmuth}}, year = 2009 } @Misc{ matvonnotes, author = {Ji{\v r}i Matou{\v s}ek and Jan Vondrak}, title = {The Probabilistic Method}, year = {2008}, note = {Lecture notes at Charles University}, doi = {} } @InProceedings{ hazansparse, author = "Elad Hazan", title = "Sparse Approximate Solutions to Semidefinite Programs", booktitle = latin08, pages = {306--316}, year = {2008}, doi = {10.1007/978-3-540-78773-0\_27} } @InProceedings{ lubynisan, author = {Michael Luby and Noam Nisan}, title = {A parallel approximation algorithm for positive linear programming}, crossref = {pstoc93}, pages = {448--457}, isbn = {0-89791-591-7}, doi = {10.1145/167088.167211} } @Article{ hw, author = {Mark Herbster and Manfred K. Warmuth}, title = {Tracking the Best Expert}, journal = {Machine Learning}, volume = {32}, number = {2}, pages = {151--178}, year = {1998}, doi = {10.1023/A:1007424614876} } @InProceedings{ bhk, author = {Boaz Barak and Moritz Hardt and Satyen Kale}, title = {The uniform hardcore lemma via approximate {Bregman} projections}, crossref = {psoda09}, pages = {1193--1200}, year = {2009}, note = {\href{http://dl.acm.org/citation.cfm?id=1496899}{[ACM DL]} \href{http://www.siam.org/proceedings/soda/2009/SODA09_129_barakb.pdf}{[SIAM PDF]}}, } @Article{ bn-mor, author = {Niv Buchbinder and Joseph (Seffi) Naor}, title = {Online Primal-Dual Algorithms for Covering and Packing}, journal = mathoperres, volume = {34}, number = {2}, pages = {270--286}, year = {2009}, doi = {10.1287/moor.1080.0363} } @Book{ alon-spencer, author = {Noga Alon and Joel H. Spencer}, title = {The Probabilistic Method}, isbn = {0-471-53588-5}, year = {1992}, publisher = {John Wiley}, doi = {10.1002/9780470277331} } @Article{ trw, author = {Koji Tsuda and Gunnar R{\"a}tsch and Manfred K. Warmuth}, title = {Matrix Exponentiated Gradient Updates for On-line Learning and {Bregman} Projection}, volume = {6}, pages = {995--1018}, year = {2005}, journal = {\href{http://jmlr.csail.mit.edu/}{J. Machine Learning Research (JMLR)}}, note = {\href{http://jmlr.csail.mit.edu/papers/volume6/tsuda05a/tsuda05a.pdf}{ [JMLR PDF] }}, doi = {} } @Article{ qip-pspace, author = {Rahul Jain and Zhengfeng Ji and Sarvagya Upadhyay and John Watrous}, title = {{QIP = PSPACE}}, journal = jacm, volume = 58, issue = 6, article = 30, pages = {30:1--30:27}, year = {2011}, note = "Preliminary version in STOC'10", doi = {10.1145/2049697.2049704} } @Article{ bnsurvey, author = {Niv Buchbinder and Joseph (Seffi) Naor}, year = {2009}, title = {The Design of Competitive Online Algorithms via a Primal-Dual Approach}, journal = {Foundations and Trends in Theoretical Computer Science}, volume = 3, number = {2-3}, pages = {93--263}, doi = {10.1561/0400000024} } @Article{ golden, author = {Sidney Golden}, title = "{Lower Bounds for the Helmholtz Function}", journal = {Physical Review }, year = 1965, month = feb, volume = 137, pages = {1127--1128}, adsurl = {http://adsabs.harvard.edu/cgi-bin/nph-bib_query?bibcode=1965PhRv..137.1127G&db_key=PHY} , adsnote = {Provided by the Smithsonian/NASA Astrophysics Data System}, doi = {10.1103/PhysRev.137.B1127} } @Article{ thompson, author = {Colin J. Thompson}, title = {Inequality with Applications in Statistical Mechanics}, journal = jmathphys, volume = 6, number = 11, pages = {1812--1823}, year = 1965, doi = {10.1063/1.1704727} } @Article{ aaabn, author = {Noga Alon and Baruch Awerbuch and Yossi Azar and Niv Buchbinder and Joseph (Seffi) Naor}, title = {The Online Set Cover Problem}, journal = siamjcomput, volume = {39}, number = {2}, pages = {361--370}, year = {2009}, note = "Preliminary version in STOC'03", doi = {10.1137/060661946} } @Article{ cms, author = {Nicol{\`o} Cesa-Bianchi and Yishay Mansour and Gilles Stoltz}, title = {Improved second-order bounds for prediction with expert advice}, journal = {Machine Learning}, volume = {66}, number = {2-3}, year = {2007}, pages = {321--352}, doi = {10.1007/s10994-006-5001-7} } @Proceedings{ pstoc93, booktitle = stoc93, year = 1993, publisher = acm } @Proceedings{ pstoc96, booktitle = stoc96, year = 1996, publisher = acm } @Proceedings{ pstoc07, booktitle = stoc07, year = 2007, publisher = acm } @Proceedings{ pfocs82, booktitle = focs82, year = 1982, publisher = ieee } @Proceedings{ pfocs88, booktitle = focs88, year = 1988, publisher = ieee } @Proceedings{ pfocs95, booktitle = focs95, year = 1995, publisher = ieee } @Proceedings{ pfocs96, booktitle = focs96, year = 1996, publisher = ieee } @Proceedings{ pfocs98, booktitle = focs98, year = 1998, publisher = ieee } @Proceedings{ pfocs05, booktitle = focs05, year = 2005, publisher = ieee } @Proceedings{ psoda95, booktitle = soda95, year = 1995, publisher = acm } @Proceedings{ psoda09, booktitle = soda09, year = 2009, publisher = acm } %%%%%%%%%%%%%%%%%%%%%%%%%% %%%%% bib of v008a007 %%%%%%%%%%%%%%%%%%%%%%%%%% %% Theory of Computing %% File: v008a622.bib %% Publication date: April 25, 2012 %% Authors: Chandra Chekuri, Sungjin Im, and Benjamin Moseley @string{acm = "ACM Press"} @string{ieee = "IEEE Comp. Soc. Press"} @string{springer = "Springer"} @string{JACM="J. ACM"} @string{SIAMJComput="SIAM J. Comput."} @string{tcs = "Theoret. Comput. Sci."} @string{Algorithmica="Algorithmica"} @STRING{mathoperres="Math. Oper. Res." } @string{focs95="Proc. 36th FOCS"} @string{stoc99="Proc. 31st STOC"} @string{stoc03="Proc. 35th STOC"} @string{stoc04="Proc. 36th STOC"} @string{soda=" Ann. ACM-SIAM Symp. on Discrete Algorithms"} @string{soda98= "Proc. 9th" # soda # " (SODA'98)"} @string{soda00= "Proc. 11th" # soda # " (SODA'00)"} @string{soda02= "Proc. 13th" # soda # " (SODA'02)"} @string{soda05= "Proc. 16th" # soda # " (SODA'05)"} @string{soda06= "Proc. 17th" # soda # " (SODA'06)"} @string{soda08= "Proc. 19th" # soda # " (SODA'08)"} @string{soda09= "Proc. 20th" # soda # " (SODA'09)"} @string{soda10= "Proc. 21st" # soda # " (SODA'10)"} @string{icalp=" Internat. Colloq. on Automata, Languages and Programming"} @string{icalp10= "Proc. 37th" # icalp # " (ICALP'10)"} @string{ipco= "Ann. Conf. on Integer Programming and Combinatorial Optimization"} @string{ipco99= "Proc. 7th" # ipco # " (IPCO'99)"} @string{ipco02= "Proc. 9th" # ipco # " (IPCO'02)"} @string{spaa = " Ann. ACM Symp. on Parallel Algorithms and Architectures"}, @string{spaa03 = "Proc. 15th" # spaa # " (SPAA'03)"}, @string{esa= " Ann. European Symp. on Algorithms"} @string{esa00= "Proc. 8th" # esa # " (ESA'00)"} @string{esa02= "Proc. 10th" # esa # " (ESA'02)"} @string{esa09= "Proc. 17th" # esa # " (ESA'09)"} @string{cocoon= " Ann. Internat. Computing and Combinatorics Conf."} @string{cocoon04= "Proc. 10th" # cocoon # " (COCOON'04)"} @string{cocoon06= "Proc. 12th" # cocoon # " (COCOON'06)"} @string{waoa= " Workshop on Approximation and Online Algorithms"} @string{waoa09= "Proc. 7th" # waoa # " (WAOA'09)"} @string{waoa10= "Proc. 8th" # waoa # " (WAOA'10)"} @ARTICLE{AcharyaFZ95, title={Dissemination-based Data Delivery Using Broadcast Disks}, author={Swarup Acharya and Michael Franklin and Stanley Zdonik}, journal={IEEE Personal Communications}, year={1995}, month={Dec}, volume={2}, number={6}, pages={50--60}, doi={10.1109/98.475988}, ISSN={1070-9916},} @article{AksoyF98, author = {Demet Aksoy and Michael Franklin}, title = {{R x W}: A Scheduling Approach for Large-Scale On-Demand Data Broadcast}, journal = {IEEE/ACM Transactions on Networking}, volume = {7}, number = {6}, year = {1999}, pages = {846-860}, doi = {10.1109/90.811450}, } @comment{added journal version of article above*} @article {AvrahamiA03, author = {Nir Avrahami and Yossi Azar}, title = {Minimizing Total Flow Time and Total Completion Time with Immediate Dispatching}, journal = {Algorithmica}, publisher = {Springer New York}, issn = {0178-4617}, pages = {253-268}, volume = {47}, issue = {3}, note = {Preliminary version in \href{http://dx.doi.org/10.1145/777412.777415}{SPAA'03}}, doi = {10.1007/s00453-006-0193-6}, year = {2007} } @inproceedings{BansalCKN05, author = {Nikhil Bansal and Moses Charikar and Sanjeev Khanna and Joseph (Seffi) Naor}, title = {Approximating The Average Response Time in Broadcast Scheduling}, booktitle = soda05, year = {2005}, isbn = {0-89871-585-7}, pages = {215--221}, publisher = "SIAM" } @article{BansalCS08, author = {Nikhil Bansal and Don Coppersmith and Maxim Sviridenko}, title = {Improved Approximation Algorithms for Broadcast Scheduling}, journal = SIAMJComput, volume = {38}, number = {3}, year = {2008}, pages = {1157-1174}, note = {Preliminary version in \href{http://dx.doi.org/10.1145/1109557.1109596}{SODA'06}}, doi = {10.1137/060674417}, } @inproceedings{BansalKN10, author = {Nikhil Bansal and Ravishankar Krishnaswamy and Viswanath Nagarajan}, title = {Better Scalable Algorithms for Broadcast Scheduling}, booktitle = icalp10, year = {2010}, pages = {324-335}, doi = {10.1007/978-3-642-14165-2\_28}, publisher = springer, } @inproceedings{BansalP03, author = {Nikhil Bansal and Kirk Pruhs}, title = {Server Scheduling in the {L$_{\mbox{p}}$} Norm: A Rising Tide Lifts All Boat}, booktitle = stoc03, year = {2003}, pages = {242-250}, doi = {10.1145/780542.780580}, publisher = acm } @article{Bar-NoyBNS02, author = {Amotz Bar-Noy and Randeep Bhatia and Joseph (Seffi) Naor and Baruch Schieber}, title = {Minimizing Service and Operation Costs of Periodic Scheduling}, journal = mathoperres, volume = {27}, number = {3}, year = {2002}, pages = {518-544}, doi = {10.1287/moor.27.3.518.314}, } @article{Bar-NoyGKNSS09, author = {Amotz Bar-Noy and Sudipto Guha and Yoav Katz and Joseph (Seffi) Naor and Baruch Schieber and Hadas Shachnai}, title = {Throughput Maximization of Real-Time Scheduling with Batching}, journal = {ACM Transactions on Algorithms}, volume = {5}, number = {2}, pages = {18:1--18:17}, year = {2009}, doi = {10.1145/1497290.1497294}, } @inproceedings{BartalM00, author = {Yair Bartal and S. Muthukrishnan}, title = {Minimizing Maximum Response Time in Scheduling Broadcasts}, booktitle = soda00, year = {2000}, isbn = {0-89871-453-2}, pages = {558--559}, PUBLISHER = "SIAM", eprint = {acm:338605}, } @inproceedings{BenderCM98, author = {Michael A. Bender and Soumen Chakrabarti and S. Muthukrishnan}, title = {Flow and Stretch Metrics for Scheduling Continuous Job Streams}, booktitle = soda98, year = {1998}, isbn = {0-89871-410-9}, pages = {270--279}, publisher = "SIAM", eprint = {acm:314613.314715} } @article{BenderCT08, author = {Michael A. Bender and Rapha{\"e}l Clifford and Kostas Tsichlas}, title = {Scheduling Algorithms for Procrastinators}, journal = {J. Scheduling}, volume = {11}, number = {2}, year = {2008}, pages = {95-104}, doi = {10.1007/s10951-007-0038-4}, } @article{BenderMR04, author = {Michael A. Bender and S. Muthukrishnan and Rajmohan Rajaraman}, title = {Approximation Algorithms for Average Stretch Scheduling}, journal = {J. Scheduling}, volume = {7}, number = {3}, year = {2004}, pages = {195-222}, doi = {10.1023/B:JOSH.0000019681.52701.8b}, } @article{BoggiaCMM05, author = {Gennaro Boggia and Pietro Camarda and Luigi Mazzeo and Marina Mongiello}, title = {Performance of Batching Schemes for Multimedia-on-Demand Services}, journal = {IEEE Transactions on Multimedia}, volume = {7}, number = {5}, year = {2005}, pages = {920-931}, doi = {10.1109/TMM.2005.854383}, } @article{Burnsb08, author = {Alan Burns and Sanjoy Baruah}, title = {Sustainability in Real-time Scheduling}, journal = {Journal of Computing Science and Engineering}, year = {2008}, volume = {2}, number = {1}, pages = {74--97}, note = {\url{http://jcse.kiise.org/PublishedPaper/topic_abstract.asp?idx=15}}, doi = {} } @inproceedings{ChanLTW04, author = {Wun-Tat Chan and Tak Wah Lam and Hing-Fung Ting and Prudence W. H. Wong}, title = {New Results on On-Demand Broadcasting with Deadline via Job Scheduling with Cancellation}, booktitle = cocoon04, year = {2004}, pages = {210-218}, publisher = {Springer Berlin / Heidelberg}, doi = {10.1007/978-3-540-27798-9\_24} } @comment{added journal version*} @article{ChangEGK08, author = {Jessica Chang and Thomas Erlebach and Renars Gailis and Samir Khuller}, title = {Broadcast Scheduling: Algorithms and Complexity}, journal = {ACM Transactions on Algorithms}, volume = {7}, number = {4}, year = {2011}, pages = {47:1--47:14}, note = {Preliminary version in \href{https://dl.acm.org/citation.cfm?doid=1347082.1347134}{SODA'08}}, doi = {10.1145/2000807.2000815}, } @inproceedings{CharikarK06, author = {Moses Charikar and Samir Khuller}, title = {A Robust Maximum Completion Time Measure for Scheduling}, booktitle = soda06, year = {2006}, isbn = {0-89871-605-5}, pages = {324--333}, publisher = "SIAM", doi = {10.1145/1109557.1109594}, } @inproceedings{ChekuriGIKLMMR10, author = {Chandra Chekuri and Avigdor Gal and Sungjin Im and Samir Khuller and Jian Li and Richard McCutchen and Benjamin Moseley and Louiqa Raschid}, title = {New Models and Algorithms for Throughput Maximization in Broadcast Scheduling - (Extended Abstract)}, booktitle = waoa10, year = {2010}, pages = {71--82}, doi = {10.1007/978-3-642-18318-8\_7}, publisher = springer, } @inproceedings{ChekuriGKK04, author = {Chandra Chekuri and Ashish Goel and Sanjeev Khanna and Amit Kumar}, title = {Multi-processor Scheduling to Minimize Flow Time with $\epsilon$ Resource Augmentation}, booktitle = stoc04, year = {2004}, pages = {363--372}, doi = {10.1145/1007352.1007411}, publisher = acm } @inproceedings{ChekuriIM09lwf, author = {Chandra Chekuri and Sungjin Im and Benjamin Moseley}, title = {Longest Wait First for Broadcast Scheduling [Extended Abstract]}, booktitle = waoa09, year = {2009}, pages = {62--74}, doi = {10.1007/978-3-642-12450-1\_6}, publisher = springer, } @inproceedings{ChekuriIM09esa, author = {Chandra Chekuri and Sungjin Im and Benjamin Moseley}, title = {Minimizing Maximum Response Time and Delay Factor in Broadcast Scheduling}, booktitle = esa09, year = {2009}, pages = {444--455}, doi = {10.1007/978-3-642-04128-0\_40}, publisher = springer, } @inproceedings{ChekuriM09, author = {Chandra Chekuri and Benjamin Moseley}, title = {Online Scheduling to Minimize the Maximum Delay Factor}, booktitle = soda09, year = {2009}, publisher = "SIAM", eprint = {acm:1496891} } @article{ChrobakDJKK06, author = {Marek Chrobak and Christoph D\"{u}rr and Wojciech Jawor and {\L}ukasz Kowalik and Maciej Kurowski}, title = {A Note on Scheduling Equal-Length Jobs to Maximize Throughput}, journal = {J. of Scheduling}, volume = {9}, number = {1}, year = {2006}, issn = {1094-6136}, pages = {71--73}, doi = {10.1007/s10951-006-5595-4}, publisher = {Kluwer Academic Publishers}, } @article{DanSS96, author = {Asit Dan and Dinkar Sitaram and Perwez Shahabuddin}, title = {Dynamic batching policies for an on-demand video server}, journal = {Multimedia Syst.}, volume = {4}, number = {3}, year = {1996}, pages = {112--121}, doi = {10.1007/s005300050016}, } @comment{cannot find this source anywhere*} @article{Deb84, author = {Rajat K. Deb}, title = {Optimal control of bulk queues with compound {P}oisson arrivals and batch service}, journal = {Opsearch.}, year = {1984}, volume = {21}, pages = {227--245}, } @article{DebS73, author = {Rajat K. Deb and Richard F. Serfozo}, title = {Optimal control of batch service queues}, journal = {Adv. Appl. Prob.}, year = {1973}, volume = {5}, pages = {340--361}, doi = {10.2307/1426040}, } @comment{1976 version of article above, not sure if you want this one too*} @article{DebS76, author = {R. K. Deb}, title = {Optimal control of batch service queues}, journal = {Adv. Appl. Prob.}, year = {1976}, volume = {8}, pages = {177--194}, doi = {10.2307/1426028}, } @comment{this entry was in 622initial-1.bib, but not in the HTML file and not listed as a citation in the article*} @article{Edmonds00, author = {Jeff Edmonds}, title = {Scheduling in the Dark}, journal = {Theor. Comput. Sci.}, volume = {235}, number = {1}, year = {2000}, pages = {109--141}, doi = {10.1016/S0304-3975(99)00186-3}, } @comment{conference version of article above*} @inproceedings{Edmonds00stoc99, author = {Jeff Edmonds}, title = {Scheduling in the Dark}, journal = stoc99, year = {1999}, pages = {179--188}, doi = {10.1145/301250.301299}, publisher = acm, } @article{EdmondsP03, author = {Jeff Edmonds and Kirk Pruhs}, title = {Multicast Pull Scheduling: When Fairness Is Fine}, journal = {Algorithmica}, volume = {36}, number = {3}, year = {2003}, pages = {315--330}, doi = {10.1007/s00453-003-1018-5}, } @article{EdmondsP04, author = {Jeff Edmonds and Kirk Pruhs}, title = {A Maiden Analysis of Longest Wait First}, journal = {ACM Trans. Algorithms}, volume = {1}, number = {1}, year = {2005}, issn = {1549-6325}, pages = {14--32}, doi = {10.1145/1077464.1077467}, } @inproceedings{EdmondsP09, author = {Jeff Edmonds and Kirk Pruhs}, title = {Scalably Scheduling Processes with Arbitrary Speedup Curves}, booktitle = soda09, year = {2009}, pages = {685--692}, doi = {10.1145/1496770.1496845}, publisher = "SIAM", } @comment{journal version of article*} @article{ErlebachH02, author = {Thomas Erlebach and Alexander Hall}, title = {{NP}-Hardness of Broadcast Scheduling and Inapproximability of Single-Source Unsplittable Min-Cost Flow}, year = {2004}, volume = {7}, journal ={Journal of Scheduling}, pages = {223--241}, note = {Preliminary version in \href{https://dl.acm.org/citation.cfm?id=545381.545405}{SODA'02}}, doi = {10.1023/B:JOSH.0000019682.75022.96}, } @article{GandhiKKW04, author = {Rajiv Gandhi and Samir Khuller and Yoo-Ah Kim and Yung-Chun (Justin) Wan}, title = {Algorithms for Minimizing Response Time in Broadcast Scheduling}, journal = {Algorithmica}, volume = {38}, number = {4}, year = {2004}, issn = {0178-4617}, pages = {597--608}, note = {Preliminary version in \href{https://dl.acm.org/citation.cfm?id=660079}{IPCO'02}}, doi = {10.1007/s00453-003-1058-x}, } @article{GandhiKPS06, author = {Rajiv Gandhi and Samir Khuller and Srinivasan Parthasarathy and Aravind Srinivasan}, title = {Dependent Rounding and Its Applications to Approximation Algorithms}, journal = JACM, volume = {53}, number = {3}, year = {2006}, issn = {0004-5411}, pages = {324--360}, doi = {10.1145/1147954.1147956}, publisher = acm, } @inproceedings{ImM10, author = {Sungjin Im and Benjamin Moseley}, title = {An Online Scalable Algorithm for Average Flow Time in Broadcast Scheduling}, booktitle = soda10, year = {2010}, pages = {1322--1333}, eprint = {acm:1873601.1873708}, publisher = "SIAM", } @article{KalyanasundaramP95, author = {Bala Kalyanasundaram and Kirk Pruhs}, title = {Speed is as Powerful as Clairvoyance}, journal = JACM, volume = 47, number = 4, year = 2000, pages = {617--643}, note = {Preliminary version in \href{http://dx.doi.org/10.1109/SFCS.1995.492478}{FOCS'95}}, doi = {10.1145/347476.347479}, } @article{KalyanasundaramPV00, author = {Bala Kalyanasundaram and Kirk R. Pruhs and Mahendran Velauthapillai}, title = {Scheduling broadcasts in wireless networks}, journal = {J. Scheduling}, year = {2001}, volume = {4}, number = {6}, pages = {339--354}, note = {Preliminary version in \href{http://dx.doi.org/10.1007/3-540-45253-2\_27}{ESA'00}}, doi = {10.1002/jos.87} } @comment{collection} @Incollection{Karger99, Author={David Karger and Cliff Stein and Joel Wein}, Title={Scheduling Algorithms}, Booktitle={Handbook on Algorithms and Theory of Computation}, Year={1999}, Editor={Mikhail J. Atallah}, Chapter={35}, publisher={CRC Press}, doi={10.1201/9781420049503-c36} } @article{KhullerK04, author = {Samir Khuller and Yoo-Ah Kim}, title = {Equivalence of two linear programming relaxations for broadcast scheduling}, journal = {Oper. Res. Lett.}, volume = {32}, number = {5}, year = {2004}, pages = {473--478}, doi = {10.1016/j.orl.2003.11.012}, } @article{KimC04, author = {Jae-Hoon Kim and Kyung-Yong Chwa}, title = {Scheduling broadcasts with deadlines}, journal = tcs, volume = {325}, number = {3}, year = {2004}, issn = {0304-3975}, pages = {479--488}, note = {Preliminary version in \href{http://dx.doi.org/10.1007/3-540-45071-8_42}{COCOON'03}}, doi = {10.1016/j.tcs.2004.02.047}, } @book{RealtimeHandbook, editor = {Insup Lee and Joseph Y-T. Leung and Sang H. Son}, title = {Handbook of Real-Time and Embedded Systems}, publisher = {CRC Press}, year = {2007}, doi = {10.1201/9781420011746}}, } @article{Pruhs07, author = {Kirk Pruhs}, title = {Competitive Online Scheduling for Server Systems}, journal = {SIGMETRICS Perform. Eval. Rev.}, volume = {34}, number = {4}, year = {2007}, issn = {0163-5999}, pages = {52--58}, doi = {10.1145/1243401.1243411}, } @inproceedings{PruhsST, author = {Kirk Pruhs and Ji\v{r}\'{i} Sgall and Eric Torng}, title = {Online Scheduling}, editor = {Joseph Y-T. Leung}, publisher = {CRC Press}, booktitle = {Handbook of Scheduling: Algorithms, Models, and Performance Analysis}, year = {2004} } @article{PruhsU03, author = {Kirk R. Pruhs and Patchrawat Uthaisombut}, title = {A Comparison of Multicast Pull Models}, journal = {Algorithmica}, volume = {42}, number = {3-4}, year = {2005}, pages = {289--307}, note = {Preliminary version in \href{http://dx.doi.org/10.1007/3-540-45749-6\_70}{ESA'02}}, doi = {10.1007/s00453-005-1170-1}, } @inproceedings{Sgall98, author = {Ji\v{r}\'{i} Sgall}, title = {On-line Scheduling}, booktitle = {Developments from a June 1996 seminar on Online algorithms}, year = {1998}, isbn = {3-540-64917-4}, pages = {196--231}, publisher = {Springer-Verlag}, eprint = {acm:723918}, } @article{Uzsoy95, author = {Reha Uzsoy}, title = {Scheduling batch processing machines with incompatible job families}, journal = {International Journal of Production Research}, volume = {33}, number = {10}, year = {1995}, pages = {2685--2708}, doi = {10.1080/00207549508904839} } @inproceedings{ZhengFCCPW06, author = {Feifeng Zheng and Stanley P. Y. Fung and Wun-Tat Chan and Francis Y. L. Chin and Chung Keung Poon and Prudence W. H. Wong}, title = {Improved On-Line Broadcast Scheduling with Deadlines}, booktitle = cocoon06, year = {2006}, pages = {320-329}, doi = {10.1007/11809678\_34}, publisher = springer, } %%%%%%%%%%%%%%%%%%%%%%%%%% %%%%% bib of v008a008 %%%%%%%%%%%%%%%%%%%%%%%%%% @STRING{ccc = " IEEE Conf. on Computational Complexity" } @STRING{random = " Internat. Workshop on Randomization and Computation" } @STRING{soda = " Ann. ACM-SIAM Symp. on Discrete Algorithms" } @STRING{acm = "ACM Press" } @STRING{acmtransalgorithms="ACM Trans. Algorithms" } @STRING{ccc09 = "Proc. 24th" # ccc # " (CCC'09)" } @STRING{ccc10 = "Proc. 25th" # ccc # " (CCC'10)" } @STRING{ccomplex= "Comput. Complexity" } @STRING{eccc = "Electron. Colloq. on Comput. Complexity (ECCC)" } @STRING{focs03 = "Proc. 44th FOCS" } @STRING{focs83 = "Proc. 24th FOCS" } @STRING{focs86 = "Proc. 27th FOCS" } @STRING{ieee = "IEEE Comp. Soc. Press" } @STRING{random10= "Proc. 15th" # random # " (RANDOM'10)" } @STRING{siamjdiscretemath="SIAM J. Discrete Math." } @STRING{soda04 = "Proc. 15th" # soda # " (SODA'04)" } @STRING{springer= "Springer" } @STRING{stoc11 = "Proc. 43rd STOC" } @STRING{stoc99 = "Proc. 31st STOC" } @STRING{tcs = "Theoret. Comput. Sci." } @Book{ alon-spencer08probab-method, author = {Noga Alon and Joel H. Spencer}, title = {The Probabilistic Method}, publisher = {John Wiley \& Sons}, year = {2008}, edition = {3rd}, doi = {10.1002/9780470277331} } @InProceedings{ BFS86cc, author = {L{\'a}szl{\'o} Babai and P{\'e}ter Frankl and J{\'a}nos Simon}, title = {Complexity classes in communication complexity theory}, crossref = {pfocs86}, pages = {337--347}, doi = {10.1109/SFCS.1986.15} } @Article{ beame06corruption, author = {Paul Beame and Toniann Pitassi and Nathan Segerlind and Avi Wigderson}, title = {A Strong Direct Product Theorem for Corruption and the Multiparty Communication Complexity of Disjointness}, journal = ccomplex, volume = {15}, number = {4}, year = {2006}, pages = {391--432}, doi = {10.1007/s00037-007-0220-2} } @InProceedings{ brody-chakrabarti09ghd, author = {Joshua Brody and Amit Chakrabarti}, title = {A Multi-Round Communication Lower Bound for Gap {H}amming and Some Consequences}, booktitle = ccc09, year = {2009}, publisher = ieee, pages = {358--368}, doi = {10.1109/CCC.2009.31} } @InProceedings{ bcrvw10ghd, author = {Joshua Brody and Amit Chakrabarti and Oded Regev and Thomas Vidick and {Ronald de} Wolf}, title = {Better Gap-{H}amming Lower Bounds via Better Round Elimination}, booktitle = random10, year = {2010}, pages = {476--489}, publisher = springer, doi = {10.1007/978-3-642-15369-3\_36} } @Article{ ccm07entropy, author = {Amit Chakrabarti and Graham Cormode and Andrew McGregor}, title = {A near-optimal algorithm for estimating the entropy of a stream}, journal = acmtransalgorithms, volume = {6}, number = {3}, year = {2010}, doi = {10.1145/1798596.1798604} } @InProceedings{ chakrabarti-regev10ghd, author = {Amit Chakrabarti and Oded Regev}, title = "An optimal lower bound on the communication complexity of gap-{H}amming-distance", crossref = {pstoc11}, pages = {51--60}, doi = {10.1145/1993636.1993644} } @InProceedings{ indyk-woodruff03ghd, author = {Piotr Indyk and David P. Woodruff}, title = {Tight Lower Bounds for the Distinct Elements Problem}, crossref = {pfocs03}, pages = {283--289}, doi = {10.1109/SFCS.2003.1238202} } @InProceedings{ jain-klauck10partition-bound, author = {Rahul Jain and Hartmut Klauck}, title = {The Partition Bound for Classical Communication Complexity and Query Complexity}, booktitle = ccc10, year = {2010}, pages = {247--258}, publisher = ieee, doi = {10.1109/CCC.2010.31} } @Article{ jks08ghd, author = {T. S. Jayram and Ravi Kumar and D. Sivakumar}, title = {The One-Way Communication Complexity of {H}amming Distance}, journal = {\href{http://dx.doi.org/10.4086/toc}{Theory of Computing}}, volume = {4}, number = {1}, year = {2008}, pages = {129--135}, doi = {10.4086/toc.2008.v004a006} } @Article{ KS92disj, author = {Bala Kalyanasundaram and Georg Schnitger}, title = {The Probabilistic Communication Complexity of Set Intersection}, journal = siamjdiscretemath, volume = {5}, number = {4}, year = {1992}, pages = {545--557}, doi = {10.1137/0405044} } @Book{ ccbook, author = {Eyal Kushilevitz and Noam Nisan}, title = {Communication complexity}, year = {1997}, publisher = {Cambridge University Press}, doi = {10.1017/CBO9780511574948} } @InProceedings{ raz99quantum-classical, author = {Ran Raz}, title = {Exponential Separation of Quantum and Classical Communication Complexity}, crossref = {pstoc99}, pages = {358--367}, doi = {10.1145/301250.301343} } @Article{ razborov90disj, author = {Alexander A. Razborov}, title = {On the distributional complexity of disjointness}, journal = tcs, volume = {106}, number = {2}, year = {1992}, pages = {385--390}, doi = {10.1016/0304-3975(92)90260-M} } @Article{ talagrand96inequality, title = "Concentration of measure and isoperimetric inequalities in product spaces", author = "Michel Talagrand", volume = 81, number = 1, pages = "73--205", year = 1996, journal = "{Publications Math{\' e}matiques de L'IH{\' E}S}", doi = {10.1007/BF02699376} } @Misc{ tao-blog09talagrand, author = "Terence Tao", title = "Talagrand's concentration inequality", year = 2009, howpublished = "Weblog entry", note = "\url{http://terrytao.wordpress.com/2009/06/09/talagrands-concentration-inequality/}" } @TechReport{ vidick11ghd, title = "A concentration inequality for the overlap of a vector on a large set with application to the communication complexity of the {G}ap-{H}amming-{D}istance problem", author = "Thomas Vidick", year = 2010, number = {TR11-051}, institution = eccc, eprint = {eccc:TR11-051}, note = {Revised, 2011} } @InProceedings{ woodruff04frequency-moments, author = {David P. Woodruff}, title = {Optimal space lower bounds for all frequency moments}, booktitle = soda04, year = {2004}, pages = {167--175}, eprint = {acm:982817} } @InProceedings{ woodruff09distinct, author = {David P. Woodruff}, title = {The average-case complexity of counting distinct elements}, booktitle = {Proceedings of the Twelfth International Conference on Database Theory (ICDT)}, year = {2009}, pages = {284-295}, doi = {10.1145/1514894.1514928} } @InProceedings{ yao83minimax, author = {Andrew Chi-Chih Yao}, title = {Lower Bounds by Probabilistic Arguments}, crossref = {pfocs83}, pages = {420--428}, doi = {10.1109/SFCS.1983.30} } @Proceedings{ pstoc99, booktitle = stoc99, year = 1999, publisher = acm } @Proceedings{ pstoc11, booktitle = stoc11, year = 2011, publisher = acm } @Proceedings{ pfocs83, booktitle = focs83, year = 1983, publisher = ieee } @Proceedings{ pfocs86, booktitle = focs86, year = 1986, publisher = ieee } @Proceedings{ pfocs03, booktitle = focs03, year = 2003, publisher = ieee } %%%%%%%%%%%%%%%%%%%%%%%%%% %%%%% bib of v008a009 %%%%%%%%%%%%%%%%%%%%%%%%%% @string{acm = "ACM Press"} @string{ieee = "IEEE Comp. Soc. Press"} @string{springer = "Springer"} @string{JACM="J. ACM"} @string{SIAMJComput="SIAM J. Comput."} @string{tcs = "Theoret. Comput. Sci."} @string{focs95="Proc. 36th FOCS"} @string{focs04="Proc. 45th FOCS"} @string{soda=" Ann. ACM-SIAM Symp. on Discrete Algorithms"} @string{soda07= "Proc. 18th" # soda # " (SODA'07)"} @string{spaa = " Ann. ACM Symp. on Parallel Algorithms and Architectures"} @string{spaa07 = "Proc. 19th" # spaa # " (SPAA'07)"} @string{latin=" Latin Amer. Symp. on Theoretical Informatics"} @string{latin08=" Proc. 8th" # latin # " (LATIN'08)"} @string{aaim08="4th Internat. Conf. on Algorithmic Aspects in Information and Management (AAIM'08)"} @article{Albers10, author = {Susanne Albers}, title = {Energy-Efficient Algorithms}, journal = {Comm. ACM}, volume = {53}, number = {5}, year = {2010}, pages = {86-96}, doi = {10.1145/1735223.1735245}, } @inproceedings{AMS, author = {Susanne Albers and Fabian M\"{u}ller and Swen Schmelzer}, title = {Speed Scaling on Parallel Processors}, booktitle = spaa07, year = {2007}, pages = {289--298}, doi = {10.1145/1248377.1248424}, publisher = acm, } @inproceedings{BKPFOCS, author = {Nikhil Bansal and Tracy Kimbrel and Kirk Pruhs}, title = {Dynamic Speed Scaling to Manage Energy and Temperature}, pages={520--529}, crossref = {pfocs04}, doi = {10.1109/FOCS.2004.24}, } @article{BKP, author = {Nikhil Bansal and Tracy Kimbrel and Kirk Pruhs}, title = {Speed Scaling to Manage Energy and Temperature}, journal = JACM, volume = {54}, number = {1}, month = mar, year = {2007}, pages = {3:1--3:39}, articleno = {3}, doi = {10.1145/1206035.1206038}, } @inproceedings{BBCP, author = { Nikhil Bansal and David P. Bunde and Ho-Leung Chan and Kirk Pruhs}, title = { Average Rate Speed Scaling}, booktitle=latin08, year={2008}, pages={240-251}, publisher=springer, eprint = {acm:1792939}, } @article{BCP, author = {Nikhil Bansal and Ho-Leung Chan and Kirk Pruhs}, title = {Speed scaling with a solar cell}, journal = tcs, volume = {410}, number = {45}, year = {2009}, doi = {10.1016/j.tcs.2009.07.004}, pages = {4580-4587}, note = {Preliminary version in \href{http://dx.doi.org/10.1007/978-3-540-68880-8\_4}{AAIM'08}}, } @article{BPS, author = {Nikhil Bansal and Kirk Pruhs and Clifford Stein}, title = {Speed Scaling for Weighted Flow Time}, journal = SIAMJComput, volume = {39}, number = {4}, year = {2009}, pages = {1294-1308}, doi = {10.1137/08072125X}, note = {Preliminary version in \href{http://dl.acm.org/citation.cfm?id=1283383.1283469}{SODA'07}}, } @article{BBS, author = {David M. Brooks and Pradip Bose and Stanley E. Schuster and Hans Jacobson and Prabhakar N. Kudva and Alper Buyuktosunoglu and John-David Wellman and Victor Zyuban and Manish Gupta and Peter W. Cook}, title = {Power-Aware Microarchitecture: Design and Modeling Challenges for Next-Generation Microprocessors}, journal = {IEEE Micro}, volume = {20}, number = {6}, year = {2000}, issn = {0272-1732}, pages = {26--44}, doi = {10.1109/40.888701}, publisher = ieee, } @inproceedings{CCL+, author = {Ho-Leung Chan and Wun-Tat Chan and Tak-Wah Lam and Lap-Kei Lee and Kin-Sum Mak and Prudence W. H. Wong}, title = {Energy Efficient Online Deadline Scheduling}, crossref = {psoda07}, pages = {795--804}, eprint = {acm:1283468}, } @article{IP, author = {Sandy Irani and Kirk R. Pruhs}, title = {Algorithmic Problems in Power Management}, journal = {SIGACT News}, volume = {36}, number = {2}, year = {2005}, issn = {0163-5700}, pages = {63--76}, publisher = acm, address = {New York, NY, USA}, doi = {10.1145/1067309.1067324}, } @comment{journal version*} @article{KK, author={Woo-Cheol Kwon and Taewhan Kim}, title={Optimal Voltage Allocation Techniques for Dynamically Variable Voltage Processors}, journal = {ACM Trans. Embed. Comput. Syst.}, issue_date = {February 2005}, volume = {4}, number = {1}, month = feb, year = {2005}, pages = {211--230}, doi = {10.1145/1053271.1053280}, publisher = acm, note = {Preliminary version in \href{http://dx.doi.org/10.1145/775832.775867}{DAC'03}}, } @article{LLY, author = {Minming Li and Becky Jie Liu and Frances F. Yao}, title = { Min-Energy Voltage Allocation for Tree-Structured Tasks}, journal = {J. Combinatorial Optimization}, volume="11", number="3", year="2006", pages="305--319", doi={10.1007/11533719\_30}, } @article{LY, author = {Minming Li and Frances F. Yao}, title = {An Efficient Algorithm for Computing Optimal Discrete Voltage Schedules}, journal = SIAMJComput, volume="35", year="2005", pages="658--671", doi={10.1137/050629434}, } @inproceedings{LYY, author = {Minming Li and Andrew C. Yao and Frances F. Yao}, title = {Discrete and Continuous Min-Energy Schedules for Variable Voltage Processors}, booktitle = {Proc. Nat. Acad. Sci. USA}, year = {2006}, volume="103", pages="3983--3987" } @article{Pruhs, author = {Kirk Pruhs}, title = {Competitive Online Scheduling for Server Systems}, journal = {SIGMETRICS Perform. Eval. Rev.}, volume = {34}, number = {4}, year = {2007}, issn = {0163-5999}, pages = {52--58}, doi = {10.1145/1243401.1243411}, } @inproceedings{YDS, author = {Frances Yao and Alan Demers and Scott Shenker}, title = {A Scheduling Model for Reduced {CPU} Energy}, crossref = {pfocs95}, pages = {374-382}, doi = {10.1109/SFCS.1995.492493}, } @article{YK, author="Han-Saem Yun and Jihong Kim", title="On Energy-Optimal Voltage Scheduling for Fixed-Priority Hard Real-Time Systems", journal="ACM Trans. Embedded Computing Systems", volume="2", number="3", year="2003", pages="393--430", doi={10.1145/860176.860183} } @Proceedings{ pfocs95, booktitle = focs95, year = 1995, publisher = ieee, } @Proceedings{ pfocs04, booktitle = focs04, year = 2004, publisher = ieee } @Proceedings{ psoda07, booktitle = soda07, year = 2007, publisher = acm, } %%%%%%%%%%%%%%%%%%%%%%%%%% %%%%% bib of v008a010 %%%%%%%%%%%%%%%%%%%%%%%%%% %% Theory of Computing %% File: v008a010.bib %% Publication date: June 1, 2012 %% Authors: Oded Goldreich and Rani Izsak @string{acm = "ACM Press"} @string{ieee = "IEEE Comp. Soc. Press"} @string{SIAMJComput="SIAM J. Comput."} @string{jcss="J. Comput. System Sci."} @string{stoc83="Proc. 15th STOC"} @string{focs82="Proc. 23rd FOCS"} @string{focs88="Proc. 29th FOCS"} @inproceedings{AKS, author = {M.~Ajtai and J.~Koml\'{o}s and E.~Szemer\'{e}di}, title = {An {$O(n\log n)$} Sorting Network}, pages = {1--9}, crossref = {pstoc83}, doi={10.1145/800061.808726} } @article{NC0_Crypto, author = {Benny Applebaum and Yuval Ishai and Eyal Kushilevitz}, title = {Cryptography in ${NC}^0$}, journal = SIAMJComput, volume = {36}, issue = {4}, year = {2006}, pages = {845--888}, doi = {10.1137/S0097539705446950} } @comment{could not find repository, could not verify} @TechReport{Berkowitz, author = {S.~J.~Berkowitz}, title = {On some relationships between monotone and non-monotone circuit complexity}, institution = {University of Toronto}, year = {1982} } @article{BM, author = {Manuel Blum and Silvio Micali}, title = {How to Generate Cryptographically Strong Sequences of Pseudo-Random Bits}, journal = SIAMJComput, volume = {13}, pages = {850--864}, year = {1984}, note = {Preliminary version in \href{http://dx.doi.org/10.1109/SFCS.1982.72}{FOCS'82}}, doi = {10.1137/0213053} } @comment{conference version of article above} @inproceedings{BMconference, author = {Manuel Blum and Silvio Micali}, title = {How to Generate Cryptographically Strong Sequences of Pseudo-Random Bits}, crossref = {pfocs82}, pages = {112--117}, doi = {10.1109/SFCS.1982.72} } @Book{G:foc1, author = {Oded Goldreich}, title = {Foundations of Cryptography: Basic Tools}, publisher = {Cambridge University Press}, year = {2001}, volume = {1} } @Book{G:cc, author = {Oded Goldreich}, title = {Computational Complexity: A Conceptual Perspective}, publisher = {Cambridge University Press}, year = {2008} } @article{HILL, author = {Johan H{\aa}stad and Russell Impagliazzo and Leonid A. Levin and Michael Luby}, title = {A Pseudorandom Generator from any One-way Function}, journal = SIAMJComput, volume = {28}, pages = {1364--1396}, year = {1999}, doi = {10.1137/S0097539793244708}, } @inproceedings{KKL, author = {Jeff Kahn and Gil Kalai and Nathan Linial}, title = {The Influence of Variables on {Boolean} Functions}, pages = {68--80}, crossref = {pfocs88}, doi = {10.1109/SFCS.1988.21923} } @article{NW, author = {Noam Nisan and Avi Wigderson}, title = {Hardness vs. Randomness}, journal = jcss, volume = {49}, issue = {2}, pages = {149--167}, year = {1994}, note = {Preliminary version in \href{http://dx.doi.org/10.1109/SFCS.1988.21916}{FOCS'88}}, doi = {10.1016/S0022-0000(05)80043-1} } @comment{conference version of article above} @inproceedings{NWconference, author = {Noam Nisan and Avi Wigderson}, title = {Hardness vs Randomness}, pages = {2-11}, crossref = {pfocs88}, doi = {10.1109/SFCS.1988.21916}, } @article{Talagrand, author = {Michel Talagrand}, title = {How much are increasing sets positively correlated?}, journal = {Combinatorica}, volume = {16}, issue = {2}, year = {1996}, pages = {243--258}, doi = {10.1007/BF01844850}, } @inproceedings{Y, author = {Andrew C. Yao}, title = {Theory and Application of Trapdoor Functions}, pages = {80--91}, crossref = {pfocs82}, doi = {10.1109/SFCS.1982.95}, } @Proceedings{pstoc83, booktitle = stoc83, year = {1983}, publisher=acm, } @Proceedings{pfocs82, booktitle = focs82, year = {1982}, publisher = ieee, } @Proceedings{pfocs88, booktitle = focs88, year = {1988}, publisher = ieee, } %%%%%%%%%%%%%%%%%%%%%%%%%% %%%%% bib of v008a011 %%%%%%%%%%%%%%%%%%%%%%%%%% %% Theory of Computing %% File: v008a011.bib %% Publication date: June 10, 2012 %% Authors: Venkatesan Guruswami and Yuan Zhou @string{acm = "ACM Press"} @string{ieee = "IEEE Comp. Soc. Press"} @string{JACM="J. ACM"} @string{SIAMJComput="SIAM J. Comput."} @string{tcs = "Theoret. Comput. Sci."} @string{ACMTransAlgorithms="ACM Trans. Algorithms"} @string{InformandComput="Inform. and Comput."} @string{jcss="J. Comput. System Sci."} @string{stoc78="Proc. 10th STOC"} @string{stoc97="Proc. 29th STOC"} @string{stoc98="Proc. 30th STOC"} @string{stoc02="Proc. 34th STOC"} @string{stoc06="Proc. 38th STOC"} @string{stoc08="Proc. 40th STOC"} @string{stoc12="Proc. 44th STOC"} @string{focs04="Proc. 45th FOCS"} @string{focs09="Proc. 50th FOCS"} @string{soda=" Ann. ACM-SIAM Symp. on Discrete Algorithms"} @string{soda06= "Proc. 17th" # soda # " (SODA'06)"} @string{soda07= "Proc. 18th" # soda # " (SODA'07)"} @inproceedings{KOTYZ12, author = {G{\'a}bor Kun and Ryan O'Donnell and Suguru Tamaki and Yuichi Yoshida and Yuan Zhou}, title = {Linear programming, width-1 {CSPs}, and robust satisfaction}, booktitle = {Proc. 3rd Innovations in Theoretical Computer Science Conf. (ITCS'12)}, year = {2012}, isbn = {978-1-4503-1115-1}, location = {Cambridge, Massachusetts}, pages = {484--495}, numpages = {12}, doi = {10.1145/2090236.2090274}, acmid = {2090274}, publisher = acm, address = {New York, NY, USA}, keywords = {approximation algorithm, constraint satisfaction problems, linear programming, robust satisfaction algorithm, width-1 CSPs}, } @comment{DGR: not yet published, so doesn't have a DOI or repository} @comment{LB: just been published, has DOI, is on ACM DL} @inproceedings{BK12, author = {Libor Barto and Marcin Kozik}, title={Robust Satisfiability of Constraint Satisfaction Problems}, crossref = {pstoc12}, pages = {931-940}, doi = {10.1145/2213977.2214061}, } @comment{not yet published} @MISC{DK11, author = {Victor Dalmau and Andrei Krokhin}, title = {Robust satisfiability for {CSP}s: {Algorithmic} and hardness results}, year = {2011}, note = {In preparation} } @inproceedings(BK-focs09, author="Libor Barto and Marcin Kozik", title="Constraint Satisfaction Problems of Bounded Width", crossref = {pfocs09}, pages="595-603", month="October", doi={10.1109/FOCS.2009.32}, ) @article{KhotR08, title={Vertex cover Might be Hard to Approximate to Within 2-$\epsilon$}, author={Khot, Subhash and Regev, Oded}, journal=jcss, volume={74}, number={3}, pages={335--349}, year={2008}, note = {Preliminary version in \href{http://dx.doi.org/10.1109/CCC.2003.1214437}{CCC'03}}, publisher={Elsevier}, doi={10.1016/j.jcss.2007.06.019}, } @article{DFHS, author = {Erik D. Demaine and Uriel Feige and Mohammad Taghi Hajiaghayi and Mohammad R. Salavatipour}, title = {Combination Can Be Hard: Approximability of the Unique Coverage Problem}, journal = SiamJComput, volume = {38}, number = {4}, year = {2008}, pages = {1464-1483}, doi = {10.1137/060656048}, note = {Preliminary version in \href{http://dx.doi.org/10.1145/1109557.1109577}{SODA'06}}, bibsource = {DBLP, http://dblp.uni-trier.de} } @comment{conference version of article above} @inproceedings{DFHSconf, author = {Erik D. Demaine and Uriel Feige and Mohammad Taghi Hajiaghayi and Mohammad R. Salavatipour}, title = {Combination Can Be Hard: Approximability of the Unique Coverage Problem}, crossref = {psoda06}, pages = {162--171}, doi = {10.1145/1109557.1109577}, } @article{CST01, author = {Pierluigi Crescenzi and Riccardo Silvestri and Luca Trevisan}, title = {On Weighted vs Unweighted Versions of Combinatorial Optimization Problems}, journal = InformandComput, volume = 167, number = 1, year = 2001, pages = {10-26}, doi = {10.1006/inco.2000.3011}, note = {Preliminary version in \href{http://www.informatik.uni-trier.de/~ley/db/conf/istcs/istcs1996.html}{ISTCS'96}}, bibsource = {DBLP, http://dblp.uni-trier.de} } @inproceedings{zwick, author = {Uri Zwick}, title = {Finding almost-satisfying assignments}, crossref = {pstoc98}, pages = {551-560}, doi = {10.1145/276698.276869}, } @article{KSTW, author = {Sanjeev Khanna and Madhu Sudan and Luca Trevisan and David P. Williamson}, title = {The Approximability of Constraint Satisfaction Problems}, journal = SiamJComput, volume = {30}, number = {6}, year = {2001}, pages = {1863-1920}, doi = {10.1137/S0097539799349948}, bibsource = {DBLP, http://dblp.uni-trier.de} } @article{hastad, author = {Johan H{\aa}stad}, title = {Some Optimal Inapproximability Results}, journal = JACM, volume = {48}, number = {4}, year = {2001}, pages = {798-859}, doi = {10.1145/502090.502098}, note = {Preliminary version in \href{http://dx.doi.org/10.1145/258533.258536}{STOC'97}}, bibsource = {DBLP, http://dblp.uni-trier.de} } @comment{conference version of article above} @inproceedings{hastadconf, author = {Johan H{\aa}stad}, title = {Some optimal inapproximability results}, crossref = {pstoc97}, doi = {10.1145/258533.258536}, } @inproceedings{prasad-stoc08, AUTHOR = {Prasad Raghavendra}, TITLE = "Optimal Algorithms and Inapproximability Results for Every {CSP}?", crossref = {pstoc08}, pages="245-254", doi={10.1145/1374376.1374414}, } @article{hell-nesetril, author = {Pavol Hell and Jaroslav Ne{\v s}et{\v r}il}, title = {Colouring, constraint satisfaction, and complexity}, journal = {Comp. Sci. Rev.}, volume = {2}, number = {3}, year = {2008}, pages = {143-163}, doi = {10.1016/j.cosrev.2008.10.003}, bibsource = {DBLP, http://dblp.uni-trier.de} } @article{JKK, author = {Peter Jonsson and Andrei Krokhin and Fredrik Kuivinen}, title = {Hard constraint satisfaction problems have hard gaps at location 1}, journal = tcs, volume = {410}, number = {38-40}, year = {2009}, pages = {3856-3874}, doi = {j.tcs.2009.05.022}, bibsource = {DBLP, http://dblp.uni-trier.de} } @inproceedings{GT-approx05, author = {Venkatesan Guruswami and Luca Trevisan}, title = {The Complexity of Making Unique Choices: Approximating 1-in-$k$ SAT}, booktitle = {Proc. 8th Internat. Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX'05)}, year = {2005}, pages = {99-110}, doi = {10.1007/11538462\_9}, } @inproceedings(schaefer, author="Thomas J. Schaefer", title="The complexity of satisfiability problems", pages="216-226", crossref = {pstoc78}, doi={10.1145/800133.804350}, ) @inproceedings{CMM-stoc06, author = {Moses Charikar and Konstantin Makarychev and Yury Makarychev}, title = {Near-Optimal Algorithms for Unique Games}, crossref = {pstoc06}, pages = {205-214}, doi = {10.1145/1132516.1132547}, } @article{CMM, author = {Moses Charikar and Konstantin Makarychev and Yury Makarychev}, title = {Near-Optimal Algorithms for Maximum ConstraintS Satisfaction Problems}, journal = ACMTransAlgorithms, volume = {5}, number = {3}, year = {2009}, doi = {10.1145/1541885.1541893}, note = {Preliminary version in \href{https://dl.acm.org/citation.cfm?id=1283391}{SODA'07}}, bibsource = {DBLP, http://dblp.uni-trier.de}, } @comment{conference version of article above} @inproceedings{CMMconf, author = {Moses Charikar and Konstantin Makarychev and Yury Makarychev}, title = {Near-Optimal Algorithms for Maximum ConstraintS Satisfaction Problems}, crossref = {psoda07}, pages = {62--68}, eprint = {acm:1283391}, } @inproceedings{khot-UG, author = {Subhash Khot}, title = {On the Power of Unique 2-Prover 1-Round Games}, crossref = {pstoc02}, pages = {767-775}, doi = {10.1145/509907.510017}, bibsource = {DBLP, http://dblp.uni-trier.de} } @article{KKMO, author = {Subhash Khot and Guy Kindler and Elchanan Mossel and Ryan O'Donnell}, title = {Optimal Inapproximability Results for {MAX-CUT} and Other 2-Variable {CSPs}?}, journal = SiamJComput, volume = {37}, number = {1}, year = {2007}, pages = {319-357}, doi = {10.1137/S0097539705447372}, note = {Preliminary version in \href{http://dx.doi.org/10.1109/FOCS.2004.49}{FOCS'04}}, bibsource = {DBLP, http://dblp.uni-trier.de} } @comment{conference version of article above} @inproceedings{KKMOconf, author = {Subhash Khot and Guy Kindler and Elchanan Mossel and Ryan O'Donnell}, title = {Optimal Inapproximability Results for {MAX-CUT} and Other 2-Variable {CSPs}?}, crossref = {pfocs04}, doi = {10.1109/FOCS.2004.49}, } @proceedings{pstoc78, booktitle = stoc78, year = {1978}, publisher = acm, } @proceedings{pstoc97, booktitle = stoc97, year = {1997}, publisher = acm, } @proceedings{pstoc98, booktitle = stoc98, year = {1998}, publisher = acm, } @proceedings{pstoc02, booktitle = stoc02, year = {2002}, publisher = acm, } @proceedings{pstoc06, booktitle = stoc06, year = {2006}, publisher = acm, } @proceedings{pstoc08, booktitle = stoc08, year = {2008}, publisher = acm, } @proceedings{pstoc12, booktitle=stoc12, year ={2012}, publisher=acm, } @proceedings{pfocs04, booktitle=focs04, year={2004}, publisher=ieee, } @proceedings{pfocs09, booktitle=focs09, year={2009}, publisher=ieee, } @proceedings{psoda06, booktitle = soda06, year = {2006}, publisher = acm, } @proceedings{psoda07, booktitle = soda07, year = {2007}, publisher = acm, } @comment{articles below are not cited} @inproceedings{anup, author = {Anup Rao}, title = {Parallel repetition in projection games and a concentration bound}, booktitle = {Proceedings of the 40th Annual ACM Symposium on Theory of Computing}, year = {2008}, pages = {1-10}, } %%%%%%%%%%%%%%%%%%%%%%%%%% %%%%% bib of v008a012 %%%%%%%%%%%%%%%%%%%%%%%%%% @string{dcs = "Department of Computer Science"} @string{lncs = "LNCS"} @string{acm = "ACM Press"} @string{ieee = "IEEE Comp. Soc. Press"} @string{ams = "Amer. Math. Soc."} @string{cup = "Cambridge Univ. Press"} @string{doklady = "Doklady Akademii Nauk SSSR, N.S."} @string{oup = "Oxford Univ. Press"} @string{springer = "Springer"} @string{SIAMJComput="SIAM J. Comput."} @string{ccomplex = "Comput. Complexity"} @string{MathOperRes = "Math. Oper. Res."} @string{SIAMJDiscreteMath="SIAM J. Discrete Math."} @string{SIAMJOptim="SIAM J. Optim."} @string{SIAMJSciComput="SIAM J. Sci. Comput."} @comment{Random Structures & Algorithms} @string{RandomStructuresAlgorithms="Random Structures Algorithms"} @string{stoc00="Proc. 32nd STOC"} @string{stoc02="Proc. 34th STOC"} @string{stoc05="Proc. 37th STOC"} @string{stoc06="Proc. 38th STOC"} @string{stoc07="Proc. 39th STOC"} @string{stoc08="Proc. 40th STOC"} @string{stoc09="Proc. 41st STOC"} @string{stoc10="Proc. 42nd STOC"} @string{focs97="Proc. 38th FOCS"} @string{focs02="Proc. 43rd FOCS"} @string{focs03="Proc. 44th FOCS"} @string{focs07="Proc. 48th FOCS"} @string{focs08="Proc. 49th FOCS"} @string{focs09="Proc. 50th FOCS"} @string{soda=" Ann. ACM-SIAM Symp. on Discrete Algorithms"} @string{soda07= "Proc. 18th" # soda # " (SODA'07)"} @string{ccc=" IEEE Conf. on Computational Complexity"} @string{ccc06="Proc. 21st" # ccc # " (CCC'06)"} @string{ccc07="Proc. 22nd" # ccc # " (CCC'07)"} @string{ccc08="Proc. 23rd" # ccc # " (CCC'08)"} @string{approx=" Internat. Workshop on Approximation Algorithms for Combinatorial Optimization Problems"} @string{approx05= "Proc. 8th" # approx # " (APPROX'05)"} @string{approx08= "Proc. 11th" # approx # " (APPROX'08)"} @string{approx09= "Proc. 12th" # approx # " (APPROX'09)"} @string{stacs=" Symp. Theoretical Aspects of Comp. Sci."} @string{stacs05= "Proc. 22nd" # stacs # " (STACS'05)"} @InProceedings{RS09:gaps, title = "Integrality Gaps for Strong {SDP} Relaxations of Unique Games", author = "Prasad Raghavendra and David Steurer", pages = "575-585", crossref = {pfocs09}, doi = {10.1109/FOCS.2009.73} } @InProceedings{BCCFV10, title = "Detecting High log-densities---an {$O(n\sp {1/4})$} Approximation for Densest {$k$}-Subgraph", author = "Aditya Bhaskara and Moses Charikar and Eden Chlamtac and Uriel Feige and Aravindan Vijayaraghavan", pages = "201-210", crossref = {pstoc10}, doi = {10.1145/1806689.1806719} } @InProceedings{Chl08, author = "Chlamtac, Eden and Singh, Gyanit", title = "Improved Approximation Guarantees Through Higher Levels of {SDP} Hierarchies", booktitle = approx08, publisher = "Springer", year = "2008", volume = "5171", pages = "49--62", series = "Lecture Notes in Computer Science", doi = {10.1007/978-3-540-85363-3\_5}, } @InProceedings{rag08, title = "Optimal algorithms and inapproximability results for every {CSP}?", author = "Prasad Raghavendra", pages = "245--254", crossref = {pstoc08}, doi = {10.1145/1374376.1374414} } @InProceedings{Tu09, title = "{CSP} Gaps and Reductions in the {L}asserre Hierarchy", author = "Madhur Tulsiani", pages = "303--312", crossref = {pstoc09}, doi = {10.1145/1536414.1536457} } @InProceedings{CMM09, title = "Integrality Gaps for {S}herali--{A}dams relaxations", author = "Moses Charikar and Konstantin Makarychev and Yury Makarychev", pages = "283--292", crossref = {pstoc09}, doi = {10.1145/1536414.1536455} } @InProceedings{BCG09, title = "{M}ax{M}in Allocation via Degree Lower-bounded Arborescences", author = "Mohammad Hossein Bateni and Moses Charikar and Venkatesan Guruswami", pages = "543--552", crossref = {pstoc09}, doi = {10.1145/1536414.1536488} } @InProceedings{MS09, title = "{S}herali-{A}dams Relaxations of the Matching Polytope", author = "Claire Mathieu and Alistair Sinclair", pages = "293--302", crossref = {pstoc09}, doi = {10.1145/1536414.1536456} } @InProceedings{ST00, title = "A {PCP} charcaterization of {NP} with optimal amortized query complexity", author = "Alex Samorodnitsky and Luca Trevisan", pages = "191--199", crossref = {pstoc00}, doi = {10.1145/335305.335329} } @comment{conf version of next item, given by authors but not cited*} @InProceedings{EH05, title = "More Efficient Queries in {PCP}s for {NP} and Improved Approximation Hardness of Maximum {CSP}", author = "Lars Engebretsen and Jonas Holmerin", pages = "497-514", crossref = {pstacs05}, doi = {10.1007/978-3-540-31856-9\_16}, } @Article{EH08, author = "Lars Engebretsen and Jonas Holmerin", title = "More Efficient Queries in {PCP}s for {NP} and Improved Approximation Hardness of Maximum {CSP}", journal = RandomStructuresAlgorithms, year = "2008", volume = "33", issue = "4", pages = "497-514", doi = {10.1002/rsa.20226}, note = {Preliminary version in \href{http://dx.doi.org/10.1007/978-3-540-31856-9\_16}{STACS'05}}, } @InProceedings{ST06conf, author = "Alex Samorodnitsky and Luca Trevisan", title = "Gowers Uniformity, Influence of Variable, and {PCP}s", pages = "11-20", crossref = {pstoc06}, doi = {10.1145/1132516.1132519} } @comment{article below added by Ben***} @Article{ST06, author = "Alex Samorodnitsky and Luca Trevisan", title = "Gowers Uniformity, Influence of Variable, and {PCP}s", journal = SIAMJComput, year = "2009", volume = "39", issue = "1", pages = "323-360", doi = {10.1137/070681612}, note ={Preliminary version in \href{http://dx.doi.org/10.1145/1132516.1132519}{STOC'06}} } @InCollection{GR08, author = "Venkatesan Guruswami and Prasad Raghavendra", title = "Constraint Satisfaction over a Non-{B}oolean Domain: Approximation Algorithms and {U}nique-{G}ames Hardness", publisher = springer, pages = "77-90", crossref = {papprox08}, doi = {10.1007/978-3-540-85363-3\_7} } @article{AM09, author = "Per Austrin and Elchanan Mossel", title = "Approximation Resistant Predicates from Pairwise Independence", journal = ccomplex, volume = "18", number = "2", year = "2009", pages = "249-271", note = {Preliminary version in \href{http://dx.doi.org/10.1109/CCC.2008.20}{CCC'08}}, doi = {10.1007/s00037-009-0272-6}, } @comment{added conference version below*} @InProceedings{AM09conf, author = "Per Austrin and Elchanan Mossel", title = "Approximation Resistant Predicates from Pairwise Independence", pages = "249-258", crossref = {pccc08}, doi = {10.1109/CCC.2008.20}, } @article{AH11, author = "Per Austrin and Johan H{\aa}stad", title = "Randomly Supported Independence and Resistance", journal = SIAMJComput, volume = "40", number = "1", year = "2011", pages = "1-27", doi = {10.1137/100783534}, note = {Preliminary version in \href{http://dx.doi.org/10.1145/1536414.1536481}{STOC'09}}, } @comment{added conference version below*} @InProceedings{AH11conf, title = "Randomly Supported Independence and Resistance", author = "Per Austrin and Johan H{\aa}stad", pages = "483-492", crossref = {pstoc09}, doi = {10.1145/1536414.1536481}, } @InProceedings{Sh08, author = "Grant Schoenebeck", title = "Linear Level {L}asserre Lower Bounds for Certain $k$-{CSP}s", pages = "593-602", crossref = {pfocs08}, doi = {10.1109/FOCS.2008.74} } @InProceedings{MM08, author={ Magen, Avner and Moharrami, Mohammad}, title = {Robust Algorithms for {\sc {M}ax {I}ndependent {S}et} on Minor-Free Graphs Based on the {S}herali--{A}dams Hierarchy}, booktitle = approx09, year = {2009}, isbn = {978-3-642-03684-2}, pages = {258--271}, location = {Berkeley, CA}, doi = {10.1007/978-3-642-03685-9\_20}, publisher = {Springer-Verlag}, address = {Berlin, Heidelberg}, } @Article{Lau03, author = "Monique Laurent", title = "A comparison of the {S}herali-{A}dams, {L}ov\'{a}sz-{S}chrijver, and {L}asserre relaxations for 0-1 programming", journal = MathOperRes, volume = "28", number = "3", pages = "470-496", month = "August", year = "2003" , doi = {10.1287/moor.28.3.470.16391} } @Article{La02, author = "Jean B. Lasserre", title = "An Explicit Equivalent Positive Semidefinite Program for Nonlinear 0-1 Programs", journal = SIAMJOptim, volume = "12", number = "3", pages = "756-769", year = "2002" , doi = {10.1137/S1052623400380079} } @Article{LS, author = "L. Lov{\'a}sz and A. Schrijver", title = "Cones of Matrices and Set-Functions and 0-1 Optimization", journal = SIAMJOptim, volume = "1", number = "2", pages = "166-190", month = "May", year = "1991" , doi = {10.1137/0801013} } @Article{FeiKra03, author = "Uriel Feige and Robert Krauthgamer", title = "The Probable Value of the {L}ov\'{a}sz-{S}chrijver Relaxations for Maximum Independent Set", journal = SIAMJComput, volume = "32", number = "2", pages = "345-370", year = "2003" , doi = {10.1137/S009753970240118X} } @article{ABLT05, author = "Sanjeev Arora and B{\'e}la Bollob{\'a}s and L{\'a}szl{\'o} Lov{\'a}sz and Iannis Tourlakis", title = "Proving Integrality Gaps without Knowing the Linear Program", year = "2006", pages = "19-51", doi = {10.4086/toc.2006.v002a002}, publisher = "Theory of Computing", journal = "Theory of Computing", volume = "2", number = "1", note ={Preliminary version in \href{http://dx.doi.org/10.1109/SFCS.2002.1181954}{FOCS'02}} } @comment{added conference version below*} @InProceedings{ABLT05conf, title = "Proving Integrality Gaps without Knowing the Linear Program", author ="Sanjeev Arora and B{\'e}la Bollob{\'a}s and L{\'a}szl{\'o} Lov{\'a}sz", pages = "313-322", crossref = {pfocs02}, doi = {10.1145/335305.335329} } @InProceedings{Tour06, title = "New lower bounds for vertex cover in the {L}ov{\'a}sz-{S}chrijver hierarchy", author = "Iannis Tourlakis", pages = "170-182", crossref = {pccc06}, doi = {10.1109/CCC.2006.28} } @InProceedings{Tourlakis05, author = " Iannis Tourlakis", title = "Towards Optimal Integrality Gaps for Hypergraph Vertex Cover in the {L}ov{\'a}sz-{S}chrijver Hierarchy", bibdate = "2005-10-10", booktitle = approx05, publisher = "Springer", year = "2005", volume = "3624", doi = {10.1007/11538462\_20}, pages = "233--244" } @InProceedings{AAT05, title = "Towards strong nonapproximability results in the {L}ov\'asz-{S}chrijver hierarchy", author = "Mikhail Alekhnovich and Sanjeev Arora and Iannis Tourlakis", pages = "294-303", crossref = {pstoc05}, doi = {10.1145/1060590.1060634} } @comment{journal version added by Ben*} @article{AAT05journal, author = "Mikhail Alekhnovich and Sanjeev Arora and Iannis Tourlakis", title = "Towards Strong Nonapproximability Results in the {L}ov{\'a}sz-{S}chrijver Hierarchy", year = "2011", pages = "615-648", doi = {10.1007/s00037-011-0027-z}, journal = ccomplex, volume = "20", number = "4", } @InProceedings{STTb, title = "Tight Integrality Gaps for {L}ov\'{a}sz-{S}chrijver {LP} Relaxations of Vertex Cover and Max Cut", author = "Grant Schoenebeck and Luca Trevisan and Madhur Tulsiani", pages = "302-310", crossref = {pstoc07}, doi = {10.1145/1250790.1250836} } @InProceedings{STTa, title = "A linear round lower bound for {L}ov\'asz-{S}chrijver {SDP} relaxations of vertex cover", author = "Grant Schoenebeck and Luca Trevisan and Madhur Tulsiani", pages = "205-216", crossref = {pccc07}, doi = {10.1109/CCC.2007.2} } @comment{conf version added by Ben *} @InProceedings{GMPT06, title = "Integrality gaps of $2-o(1)$ for {V}ertex {C}over {SDP}s in the {L}ov\'{a}sz-{S}chrijver hierarchy", author = "Konstantinos Georgiou and Avner Magen and Toniann Pitassi and Iannis Tourlakis", pages = "702-712", crossref = {pfocs07}, doi = {10.1109/FOCS.2007.35}, } @article{GMPT10, author = "Konstantinos Georgiou and Avner Magen and Toniann Pitassi and Iannis Tourlakis", title = "Integrality gaps of $2-o(1)$ for {V}ertex {C}over {SDP}s in the {L}ov\'{a}sz-{S}chrijver hierarchy", journal = SIAMJComput, volume = "39", number = "8", year = "2010", pages = "3553-3570", doi = {10.1137/080721479}, note = {Preliminary version in \href{http://dx.doi.org/10.1109/FOCS.2007.35}{FOCS'07}}, } @InProceedings{Ch07, title = "Approximation Algorithms Using Hierarchies of Semidefinite Programming Relaxations", author = "Eden Chlamtac", pages = "691-701", crossref = {pfocs07}, doi = {10.1109/FOCS.2007.72} } @article{SA90, 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 = SIAMJDiscreteMath, volume = "3", number = "3", month = "August", year = "1990", pages = "411-430", doi = {10.1137/0403036}, } @InProceedings{FK07, title = "Linear Programming Relaxations of Maxcut", author = "Fernandez de la Vega, Wenceslas and Kenyon-Mathieu, Claire", pages = "53-61", crossref = {psoda07}, eprint = {acm:1283390}, } @article{BGHMP, 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", journal = "Theory of Computing", year = "2006", volume = "2", number = "4", pages = "65-90", publisher = "Theory of Computing", doi = {10.4086/toc.2006.v002a004}, note = {Preliminary version in \href{http://dx.doi.org/10.1109/SFCS.2003.1238206}{FOCS'03}}, } @comment{added conference version below} @InProceedings{BGHMPconf, title = "Rank bounds and integrality gaps for cutting planes procedures", author = "Joshua Buresh-Oppenheim Nicola Galesi Shlomo Hoory Avner Magen and Toniann Pitassi", pages = "318-327", crossref = {pfocs03}, doi = {10.1109/SFCS.2003.1238206}, } @Proceedings{ papprox08, booktitle = approx08, year = 2008, publisher = springer } @Proceedings{ psoda07, booktitle = soda07, year = 2007, publisher = "SIAM" } @Proceedings{ pstacs05, booktitle = stacs05, year = 2005, publisher = springer } @Proceedings{ pstoc00, booktitle = stoc00, year = 2010, publisher = acm } @Proceedings{ pstoc02, booktitle = stoc02, year = 2002, publisher = acm } @Proceedings{ pstoc05, booktitle = stoc05, year = 2005, publisher = acm } @Proceedings{ pstoc06, booktitle = stoc06, year = 2006, publisher = acm } @Proceedings{ pstoc07, booktitle = stoc07, year = 2007, publisher = acm } @Proceedings{ pstoc08, booktitle = stoc08, year = 2008, publisher = acm, } @Proceedings{ pstoc09, booktitle = stoc09, year = 2009, publisher = acm } @Proceedings{ pstoc10, booktitle = stoc10, year = 2010, publisher = acm } @Proceedings{ pfocs97, booktitle = focs97, year = 1997, publisher = ieee } @Proceedings{ pfocs02, booktitle = focs02, year = 2002, publisher = ieee } @Proceedings{ pfocs03, booktitle = focs03, year = 2003, publisher = ieee } @Proceedings{ pfocs07, booktitle = focs07, year = 2007, publisher = ieee } @Proceedings{ pfocs08, booktitle = focs08, year = 2008, publisher = ieee } @Proceedings{ pfocs09, booktitle = focs09, year = 2009, publisher = ieee } @Proceedings{ pccc06, booktitle = ccc06, year = 2006, publisher = ieee } @Proceedings{ pccc07, booktitle = ccc07, year = 2007, publisher = ieee } @Proceedings{ pccc08, booktitle = ccc08, year = 2008, publisher = ieee } %%%%%%%%%%%%%%%%%%%%%%%%%% %%%%% bib of v008a013 %%%%%%%%%%%%%%%%%%%%%%%%%% %% Theory of Computing %% File: v008a013.bib %% Publication date: July 5, 2012 %% Authors: Ben Reichardt and Robert Spalek @comment{6-30-2012 2:30 pm version: added journal version of bce:size-depth} @PREAMBLE{ {\providecommand{\noopsort}[1]{}} } @string{acm = "ACM Press"} @string{ieee = "IEEE Comp. Soc. Press"} @string{springer = "Springer"} @string{SIAMJComput="SIAM J. Comput."} @string{tcs = "Theoret. Comput. Sci."} @string{combinatorica = "Combinatorica"} @string{ccomplex = "Comput. Complexity"} @string{ipl = "Inform. Process. Lett."} @string{jcss="J. Comput. System Sci."} @string{QuantumInfComput="Quantum Inf. Comput."} @string{RandomStructuresAlgorithms="Random Structures Algorithms"} @string{stoc96="Proc. 28th STOC"} @string{stoc03="Proc. 35th STOC"} @string{stoc07="Proc. 39th STOC"} @string{stoc08="Proc. 40th STOC"} @string{stoc12="Proc. 44th STOC"} @string{focs86="Proc. 27th FOCS"} @string{focs91="Proc. 32nd FOCS"} @string{focs95="Proc. 36th FOCS"} @string{focs03="Proc. 44th FOCS"} @string{focs04="Proc. 45th FOCS"} @string{focs07="Proc. 48th FOCS"} @string{focs11="Proc. 52nd FOCS"} @string{soda=" Ann. ACM-SIAM Symp. on Discrete Algorithms"} @string{soda11= "Proc. 22nd" # soda # " (SODA'11)"} @string{ccc=" IEEE Conf. on Computational Complexity"} @string{sct=" IEEE Conf. on Structure in Complexity Theory"} @string{ccc91="Proc. 6th" # sct } @string{ccc93="Proc. 8th" # sct } @string{ccc03="Proc. 18th" # ccc # " (CCC'03)"} @string{icalp=" Internat. Colloq. on Automata, Languages and Programming"} @string{icalp11= "Proc. 38th" # icalp # " (ICALP'11)"} @techreport{kimmel11adversary, title = {Quantum adversary (upper) bound}, author = {Shelby Kimmel}, Eprint = {arXiv:1101.0797}, year = {2011}, keywords = {span programs}, } @techreport{zhankimmelhassidim11spanprogram-original, title = {Super-polynomial quantum speed-ups for boolean evaluation trees with hidden structure}, author = {Bohua Zhan and Shelby Kimmel and Avinatan Hassidim}, Eprint = {arXiv:1101.0796}, year = {2011}, keywords = {span programs}, } @comment{need entry for conference**} @comment{conference version*} @inproceedings{zhankimmelhassidim11spanprogram, title = {Super-polynomial quantum speed-ups for boolean evaluation trees with hidden structure}, author = {Bohua Zhan and Shelby Kimmel and Avinatan Hassidim}, booktitle = {Innovations in Theoretical Computer Science 2012 (ITCM'12)}, publisher = acm, year = {2012}, pages = {249-265}, doi = {10.1145/2090236.2090258}, Eprint = {arXiv:1101.0796}, bibsource = {DBLP, http://dblp.uni-trier.de}, } @techreport{gavinskyito12graphcollision, title = {A quantum query algorithm for the graph collision problem}, author = {Dmitry Gavinsky and Tsuyoshi Ito}, Eprint = {arXiv:1204.1527}, year = {2012}, keywords = {span programs}, } @techreport{belovsreichardt12connectivity, title = {Span programs and quantum algorithms for $st$-connectivity and claw detection}, author = {Aleksandrs Belovs and Ben W. Reichardt}, Eprint = {arXiv:1203.2603}, year = {2012}, keywords = {span programs}, } @techreport{kitaev95phaseestimation, title = {Quantum measurements and the {A}belian stabilizer problem}, author = {A. Yu. Kitaev}, Eprint = {arXiv:quant-ph/9511026}, year = {1995}, } @inproceedings{grover96search, title = {A Fast Quantum Mechanical Algorithm for Database Search}, author = {Lov K. Grover}, crossref = {pstoc96}, pages = {212-219}, Eprint = {arXiv:quant-ph/9605043}, doi = {10.1145/237814.237866}, bibsource = {DBLP, http://dblp.uni-trier.de}, } @article{grover96searchtime, title = {Tradeoffs in the quantum search algorithm}, author = {Lov K. Grover}, journal = {Phys. Rev. A}, volume = {66}, year = {2002}, pages = {052314}, Eprint = {arXiv:quant-ph/0201152}, doi = {10.1103/PhysRevA.66.052314}, } @comment{replaced arXiv version} @inproceedings{leemittalreichardtspalekszegedy11stateconversion, title = {Quantum Query Complexity of State Conversion}, author = {Troy Lee and Rajat Mittal and Ben W. Reichardt and Robert {\v S}palek and Mario Szegedy}, crossref = {pfocs11}, pages = {344-353}, Eprint = {arXiv:1011.3020}, doi = {10.1109/FOCS.2011.75}, bibsource = {DBLP, http://dblp.uni-trier.de}, } @inproceedings{hoyerleespalek07negativeadv, title = {Negative weights make adversaries stronger}, author = {Peter H{\o}yer and Troy Lee and Robert {\v S}palek}, crossref = {pstoc07}, pages = {526-535}, Eprint = {arXiv:quant-ph/0611054}, doi = {10.1145/1250790.1250867}, } @techreport{belovs11triangle-original, title = {Span programs for functions with constant-sized 1-certificates}, author = {Aleksandrs Belovs}, Eprint = {arXiv:quant-ph/0611054}, year = {2011}, keywords = {span programs}, } @comment{conference version*} @inproceedings{belovs11triangle, title = {Span programs for functions with constant-sized 1-certificates: extended abstract}, author = {Aleksandrs Belovs}, crossref = {pstoc12}, Eprint = {arXiv:quant-ph/0611054}, doi = {10.1145/2213977.2213985}, } @techreport{belovslee11learninggraph, title = {Quantum algorithm for $k$-distinctness with prior knowledge on the input}, author = {Aleksandrs Belovs and Troy Lee}, Eprint = {arXiv:1108.3022}, year = {2011}, keywords = {span programs}, } @techreport{leemagniezsantha11learninggraph, title = {A learning graph based quantum query algorithm for finding constant-size subgraphs}, author = {Troy Lee and Fr{\'e}d{\'e}ric Magniez and Miklos Santha}, Eprint = {arXiv:1109.5135}, year = {2011}, keywords = {span programs}, } @techreport{zhu11learninggraph, title = {Quantum query complexity of subgraph containment with constant-sized certificates}, author = {Yechao Zhu}, Eprint = {arXiv:1109.4165}, year = {2011}, keywords = {span programs}, } @inproceedings{amano11andorlower, title = {Bounding the Randomized Decision Tree Complexity of Read-Once Boolean Functions}, author = {Kazuyuki Amano}, crossref = {psoda11}, pages = {1729-1744}, eprint = {acm:2133169}, bibsource = {DBLP, http://dblp.uni-trier.de}, } @article{heimanwigderson91generalandor, title = {Randomized VS. Deterministic Decision Tree Complexity for Read-Once {B}oolean Functions}, author = {Rafi Heiman and Avi Wigderson}, journal = ccomplex, volume = {1}, year = {1991}, pages = {311-329}, doi = {10.1007/BF01212962}, note = {Preliminary version in \href{http://dx.doi.org/10.1109/SCT.1991.160258}{Structure in Complexity Theory'91}}, bibsource = {DBLP, http://dblp.uni-trier.de}, } @comment{conference version*} @inproceedings{heimanwigderson91generalandor-conference, title = {Randomized vs. Deterministic Decision Tree Complexity for Read-Once Boolean Functions}, author = {Rafi Heiman and Avi Wigderson}, booktitle = ccc91, publisher = ieee, year = {1991}, pages = {172-179}, doi = {10.1109/SCT.1991.160258}, } @inproceedings{reichardt09andorfaster, title = {Faster quantum algorithm for evaluating game trees}, author = {\noopsort{Ben Reichardt11a}{Ben Reichardt}}, crossref = {psoda11}, pages = {546-559}, eprint = {acm:2133079, arXiv:0907.1623}, Eprint = {arXiv:0907.1623}, bibsource = {DBLP, http://dblp.uni-trier.de}, } @techreport{belovs11rank, title = {Span-program-based quantum algorithm for the rank problem}, author = {Aleksandrs Belovs}, Eprint = {arXiv:1103.0842}, year = {2011}, keywords = {span programs}, } @inproceedings{magnieznayaksanthaxiao10majority, title = {Improved Bounds for the Randomized Decision Tree Complexity of Recursive Majority}, author = {Fr{\'e}d{\'e}ric Magniez and Ashwin Nayak and Miklos Santha and David Xiao}, booktitle = icalp11, publisher = springer, year = {2011}, pages = {317-329}, doi = {10.1007/978-3-642-22006-7\_27}, bibsource = {DBLP, http://dblp.uni-trier.de}, } @book{nielsenchuang00, title = {Quantum computation and quantum information}, author = {Michael A. Nielsen and Isaac L. Chuang}, publisher = {Cambridge University Press}, year = {2000}, keywords = {textbook}, address = {Cambridge}, } @article{nagajwocjanzhang09qma, title = {Fast amplification of {QMA}}, author = {Daniel Nagaj and Pawel Wocjan and Yong Zhang}, journal = QuantumInfComput, number = {11}, volume = {9}, year = {2011}, pages = {1053-1068}, eprint = {acm:2012106, arXiv:0904.1549}, bibsource = {DBLP, http://dblp.uni-trier.de}, } @inproceedings{reichardtspalek08spanprogram, title = {Span-program-based quantum algorithm for evaluating formulas}, author = {Ben W. Reichardt and Robert {\v S}palek}, rating = {5}, crossref = {pstoc08}, pages = {103-112}, Eprint = {arXiv:0710.2630v3}, doi = {10.1145/1374376.1374394}, } @article{ambainischildsreichardtspalekzhang07andor, title = {Any {AND-OR} formula of size {$N$} can be evaluated in time {${N}^{1/2+o(1)}$} on a quantum computer}, author = {Andris Ambainis and Andrew M. Childs and Ben W. Reichardt and Robert {\v S}palek and Shengyu Zhang}, volume = {39}, journal = SIAMJComput, number = {6}, note = {Preliminary version in \href{http://dx.doi.org/10.1109/FOCS.2007.10}{FOCS'07}}, year = {2010}, pages = {2513-2530}, doi = {10.1137/080712167}, } @comment{conference version*} @inproceedings{ambainischildsreichardtspalekzhang07andor-conference, author = {Andris Ambainis and Andrew M. Childs and Ben Reichardt and Robert {\v S}palek and Shengyu Zhang}, title = {Any AND-OR Formula of Size N can be Evaluated in time N$^{\mbox{1/2+o(1)}}$ on a Quantum Computer}, crossref = {pfocs07}, doi = {10.1109/FOCS.2007.10}, bibsource = {DBLP, http://dblp.uni-trier.de} } @techreport{reichardt09spanprogram-arxivandfocs, title = {Span programs and quantum query complexity: {T}he general adversary bound is nearly tight for every boolean function (70 pp.)}, author = {\noopsort{Ben Reichardt09}{Ben W. Reichardt}}, rating = {5}, pages = {70}, eprint = {arxiv:0904.2759}, note = {Extended abstract in \href{http://dx.doi.org/10.1109/FOCS.2009.55}{FOCS'09}}, year = {2009}, keywords = {span programs}, } @unpublished{reichardt09unbalancedformula, title = {Span-program-based quantum algorithm for evaluating unbalanced formulas}, author = {\noopsort{Ben Reichardt11c}{Ben W. Reichardt}}, note = {6th Conf. Theory of Quantum Computation, Communication and Cryptography (TQC)}, Eprint = {arXiv:0907.1622}, year = {2011}, keywords = {span programs}, } @inproceedings{reichardt10advtight, title = {Reflections for quantum query algorithms}, author = {\noopsort{Ben Reichardt11b}{Ben Reichardt}}, crossref = {psoda11}, pages = {560-569}, eprint = {acm:2133080, arXiv:1005.1601}, bibsource = {DBLP, http://dblp.uni-trier.de}, } @article{allenderbealsogihara99span, title = {The Complexity of Matrix Rank and Feasible Systems of Linear Equations}, author = {Eric Allender and Robert Beals and Mitsunori Ogihara}, journal = ccomplex, number = {2}, volume = {8}, year = {1999}, pages = {99-126}, doi = {10.1007/s000370050023}, note = {Preliminary version in \href{http://dx.doi.org/10.1145/237814.237856}{STOC'96}}, bibsource = {DBLP, http://dblp.uni-trier.de}, } @comment{conference version*} @inproceedings{allenderbealsogihara99span-conference, title = {The Complexity of Matrix Rank and Feasible Systems of Linear Equations (Extended Abstract)}, author = {Eric Allender and Robert Beals and Mitsunori Ogihara}, crossref = {pstoc96}, pages = {161-167}, doi = {10.1145/237814.237856}, } @article{babaigalwigderson99superpolyspanprogram, title = {Superpolynomial Lower Bounds for Monotone Span Programs}, author = {L{\'a}szl{\'o} Babai and Anna G{\'a}l and Avi Wigderson}, journal = combinatorica, number = {3}, volume = {19}, year = {1999}, pages = {301-319}, doi = {10.1007/s004930050058}, note = {Preliminary version in \href{http://dx.doi.org/10.1145/237814.238010}{STOC'96}}, bibsource = {DBLP, http://dblp.uni-trier.de}, } @comment{conference version*} @inproceedings{babaigalwigderson99superpolyspanprogram-conference, title = {Extremal Bipartite Graphs and Superpolynomial Lower Bounds for Monotone Span Programs}, author = {L{\'a}szl{\'o} Babai and Anna G{\'a}l and J{\'a}nos Koll{\'a}r and Lajos R{\'o}nyai and Tibor Szab{\'o} and Avi Wigderson}, crossref = {pstoc96}, pages = {603-611}, doi = {10.1145/237814.238010}, } @article{beimelgalpaterson96spanprogram, title = {Lower bounds for monotone span programs}, author = {Amos Beimel and Anna G{\'a}l and Mike Paterson}, volume = {6}, journal = ccomplex, number = {1}, note = {Preliminary version in \href{http://dx.doi.org/10.1109/SFCS.1995.492669}{FOCS'95}}, year = {1996}, pages = {29-45}, doi = {10.1007/BF01202040}, bibsource = {DBLP, http://dblp.uni-trier.de}, } @comment{conference version*} @inproceedings{beimelgalpaterson96spanprogram-conference, title = {Lower Bounds for Monotone Span Programs}, author = {Amos Beimel and Anna G{\'a}l and Mike Paterson}, crossref = {pfocs95}, pages = {674-681}, doi = {10.1109/SFCS.1995.492669}, } @inproceedings{nikovnikovapreneel05spanprogram, title = {On the Size of Monotone Span Programs}, author = {Ventzislav Nikov and Svetla Nikova and Bart Preneel}, booktitle = {4th Internat. Conf. on Security in Communication Networks (SCN'04)}, publisher = springer, year = {2004}, pages = {249-262}, doi = {10.1007/978-3-540-30598-9\_18}, bibsource = {DBLP, http://dblp.uni-trier.de}, } @inproceedings{cramerfehr02secretshare, title = {Optimal Black-Box Secret Sharing over Arbitrary Abelian Groups}, author = {Ronald Cramer and Serge Fehr}, booktitle = {22nd Ann. Internat. Cryptology Conf. (CRYPTO'02)}, publisher = springer, year = {2002}, pages = {272-287}, doi = {10.1007/3-540-45708-9\_18}, bibsource = {DBLP, http://dblp.uni-trier.de}, } @book{golubvanloan96matrixcomputations, title = {Matrix Computations}, author = {Gene~H. Golub and Charles~F. {Van Loan}}, publisher = {Johns Hopkins}, edition = {3rd}, year = {1996}, address = {Baltimore}, } @unpublished{hoyerleespalek07negativeadvurl, Title = {Source codes of semidefinite programs for {ADV$^{\pm}$}}, author = {Peter H{\o}yer and Troy Lee and Robert {\v S}palek}, note = {\href{http://www.ucw.cz/~robert/papers/adv/}{[Link]}}, year = {2006}, } @comment{related STOC'07 paper appears above*} @inproceedings{barnumsaksszegedy03adv, title = {Quantum query complexity and semi-definite programming}, author = {Howard Barnum and Michael Saks and Mario Szegedy}, booktitle = ccc03, publisher = ieee, year = {2003}, pages = {179-193}, doi = {10.1109/CCC.2003.1214419}, } @comment{LB found DOI on IEEE site} @inproceedings{karchmerwigderson93span, title = {On Span Programs}, author = {Mauricio Karchmer and Avi Wigderson}, booktitle = ccc93, publisher = ieee, year = {1993}, pages = {102-111}, doi = {10.1109/SCT.1993.336536}, } @inproceedings{jayramkumarsivakumar03majority, title = {Two applications of information complexity}, author = {T. S. Jayram and Ravi Kumar and D. Sivakumar}, crossref = {pstoc03}, pages = {673-682}, doi = {10.1145/780542.780640}, bibsource = {DBLP, http://dblp.uni-trier.de}, } @inproceedings{szegedy04walkfocs, title = {Quantum Speed-Up of {M}arkov Chain Based Algorithms}, author = {Mario Szegedy}, crossref = {pfocs04}, pages = {32-41}, Eprint = {arXiv:quant-ph/0401053}, doi = {10.1109/FOCS.2004.53}, bibsource = {DBLP, http://dblp.uni-trier.de}, } @article{bb:size-depth, title = {Size-depth tradeoffs for {Boolean} formulae}, author = {Maria~Luisa~Bonet and Samuel~R.~Buss}, journal = ipl, number = {3}, volume = {49}, year = {1994}, pages = {151-155}, doi = {10.1016/0020-0190(94)90093-0}, } @article{fgg:and-or, title = {A Quantum Algorithm for the {H}amiltonian {NAND} Tree}, author = {Edward Farhi and Jeffrey Goldstone and Sam Gutmann}, journal = {Theory of Computing}, number = {1}, volume = {4}, year = {2008}, pages = {169-190}, doi = {10.4086/toc.2008.v004a008}, bibsource = {DBLP, http://dblp.uni-trier.de}, } @article{ccjy:and-or, title = {Discrete-Query Quantum Algorithm for {NAND} Trees}, author = {Andrew M. Childs and Richard Cleve and Stephen P. Jordan and David L. Yonge-Mallo}, journal = {Theory of Computing}, number = {1}, volume = {5}, year = {2009}, pages = {119-123}, doi = {10.4086/toc.2009.v005a005}, bibsource = {DBLP, http://dblp.uni-trier.de}, } @article{bce:size-depth, title = {Size-Depth Tradeoffs for Algebraic Formulas}, author = {Nader H. Bshouty and Richard Cleve and Wayne Eberly}, journal = SIAMJComput, volume = {24}, number = {4}, year = {1995}, pages = {682-705}, doi = {10.1137/S0097539792232586}, note = {Preliminary version in \href{http://dx.doi.org/10.1109/SFCS.1991.185387}{FOCS'91}}, } @comment{journal version above found by Ishay*} @inproceedings{bce:size-depth-conf, title = {Size-Depth Tradeoffs for Algebraic Formulae}, author = {Nader H. Bshouty and Richard Cleve and Wayne Eberly}, crossref = {pfocs91}, pages = {334-341}, doi = {10.1109/SFCS.1991.185387}, bibsource = {DBLP, http://dblp.uni-trier.de}, } @article{bs:q-read-once, title = {A lower bound on the quantum query complexity of read-once functions}, author = {Howard Barnum and Michael Saks}, journal = jcss, number = {2}, volume = {69}, year = {2004}, pages = {244--258}, doi = {10.1016/j.jcss.2004.02.002}, Eprint = {arXiv:quant-ph/0201007}, bibsource = {DBLP, http://dblp.uni-trier.de}, } @article{santha:and-or, author = {Miklos Santha}, title = {On the {M}onte {C}arlo Boolean Decision Tree Complexity of Read-Once Formulae}, journal = RandomStructuresAlgorithms, volume = {6}, number = {1}, year = {1995}, pages = {75-88}, doi = {10.1002/rsa.3240060108}, Note = {Preliminary version in \href{http://dx.doi.org/10.1109/SCT.1991.160259}{Structure in Complexity Theory'91}}, bibsource = {DBLP, http://dblp.uni-trier.de} } @comment{conference version*} @comment{LB found DOI on IEEE site} @inproceedings{santha:and-or-conference, author = {Miklos Santha}, title = {On the Monte Carlo Boolean Decision Tree Complexity of Read-Once Formulae}, booktitle = ccc91, publisher = ieee, year = {1991}, pages = {180-187}, doi = {10.1109/SCT.1991.160259}, bibsource = {DBLP, http://dblp.uni-trier.de} } @article{snir:dec, title = {Lower Bounds on Probabilistic Linear Decision Trees}, author = {Marc Snir}, journal = tcs, volume = {38}, year = {1985}, pages = {69-82}, doi = {10.1016/0304-3975(85)90210-5}, bibsource = {DBLP, http://dblp.uni-trier.de}, } @inproceedings{sw:and-or, title = {Probabilistic {Boolean} Decision Trees and the Complexity of Evaluating Game Trees}, author = {Michael E. Saks and Avi Wigderson}, crossref = {pfocs86}, pages = {29-38}, doi = {10.1109/SFCS.1986.44}, bibsource = {DBLP, http://dblp.uni-trier.de}, } @article{ambainis06polynomial, title = {Polynomial degree vs. quantum query complexity}, author = {Andris Ambainis}, journal = jcss, number = {2}, volume = {72}, year = {2006}, pages = {220-238}, doi = {10.1016/j.jcss.2005.06.006}, eprint = {arXiv:quant-ph/0305028}, note = {Preliminary version in \href{http://dx.doi.org/10.1109/SFCS.2003.1238197}{FOCS'03}}, bibsource = {DBLP, http://dblp.uni-trier.de}, } @comment{conference version*} @inproceedings{ambainis06polynomial-conference, title = {Polynomial Degree vs. Quantum Query Complexity}, author = {Andris Ambainis}, crossref = {pfocs03}, pages = {230-239}, doi = {10.1109/SFCS.2003.1238197}, } @proceedings{pstoc96, booktitle = stoc96, year = {1996}, publisher = acm, } @proceedings{pstoc03, booktitle = stoc03, year = {2003}, publisher = acm, } @proceedings{pstoc07, booktitle = stoc07, year = {2007}, publisher = acm, } @proceedings{pstoc08, booktitle = stoc08, year = {2008}, publisher = acm, } @proceedings{pstoc12, booktitle = stoc12, year = {2012}, publisher = acm, } @proceedings{pfocs86, booktitle=focs86, year={1986}, publisher=ieee, } @proceedings{pfocs91, booktitle=focs91, year={1991}, publisher=ieee, } @proceedings{pfocs95, booktitle=focs95, year={1995}, publisher=ieee, } @proceedings{pfocs03, booktitle=focs03, year={2003}, publisher=ieee, } @proceedings{pfocs04, booktitle=focs04, year={2004}, publisher=ieee, } @proceedings{pfocs07, booktitle=focs07, year={2007}, publisher=ieee, } @proceedings{pfocs11, booktitle=focs11, year={2011}, publisher=ieee, } @proceedings{psoda11, booktitle = soda11, year = {2011}, publisher = acm, } %%%%%%%%%%%%%%%%%%%%%%%%%% %%%%% bib of v008a014 %%%%%%%%%%%%%%%%%%%%%%%%%% @string{acm = "ACM Press"} @string{ieee = "IEEE Comp. Soc. Press"} @string{springer = "Springer"} @string{JACM="J. ACM"} @string{SIAMJComput="SIAM J. Comput."} @string{combinatorica = "Combinatorica"} @string{DiscreteComputGeom="Discrete Comput. Geom."} @string{InformandComput="Inform. and Comput."} @string{ipl = "Inform. Process. Lett."} @string{jcss="J. Comput. System Sci."} @string{SIAMJDiscreteMath="SIAM J. Discrete Math."} @string{stoc97="Proc. 29th STOC"} @string{stoc98="Proc. 30th STOC"} @string{stoc99="Proc. 31st STOC"} @string{stoc00="Proc. 32nd STOC"} @string{stoc02="Proc. 34th STOC"} @string{stoc04="Proc. 36th STOC"} @string{stoc05="Proc. 37th STOC"} @string{focs75="Proc. 16th FOCS"} @string{focs94="Proc. 35th FOCS"} @string{focs95="Proc. 36th FOCS"} @string{focs01="Proc. 42nd FOCS"} @string{focs05="Proc. 46th FOCS"} @string{focs06="Proc. 47th FOCS"} @string{focs10="Proc. 51st FOCS"} @string{soda=" Ann. ACM-SIAM Symp. on Discrete Algorithms"} @string{soda93= "Proc. 4th" # soda # " (SODA'93)"} @string{soda94= "Proc. 5th" # soda # " (SODA'94)"} @string{soda02= "Proc. 13th" # soda # " (SODA'02)"} @string{soda06= "Proc. 17th" # soda # " (SODA'06)"} @string{soda08= "Proc. 19th" # soda # " (SODA'08)"} @string{colt=" Ann. Conf. on Learning Theory"} @string{colt89= "Proc. 2nd" # colt # " (COLT'89)"} @string{icalp=" Internat. Colloq. on Automata, Languages and Programming"} @string{icalp01= "Proc. 28th" # icalp # " (ICALP'01)"} @string{scg=" Ann. Symp. on Computational Geometry"} @string{scg97= "Proc. 13th" # scg # " (SCG'97)"} @string{scg04= "Proc. 20th" # scg # " (SCG'04)"} @string{scg06= "Proc. 22nd" # scg # " (SCG'06)"} @string{vldb=" Internat. Conf. on Very Large Data Bases"} @string{vldb98="Proc. 24th" # vldb # " (VLDB'98)"} @article{jl, title = {Extensions of {L}ipschitz mapping into {H}ilbert space}, author = {William B. Johnson and Joram Lindenstrauss}, journal = {Contemporary Mathematics}, volume = {26}, year = {1984}, pages = {189--206}, } @comment{prelim version in STOC'06*** (DR fixed)} @article{ac2, title = {The Fast {J}ohnson--{L}indenstrauss Transform and Approximate Nearest Neighbors}, author = {Nir Ailon and Bernard Chazelle}, journal = SIAMJComput, number = {1}, volume = {39}, year = {2009}, bibsource = {DBLP, http://dblp.uni-trier.de}, pages = {302-322}, note = {Preliminary version in \href{http://dx.doi.org/10.1145/1132516.1132597}{STOC'06}}, doi = {10.1137/060673096}, } @article{ac1, title = {Faster dimension reduction}, author = {Nir Ailon and Bernard Chazelle}, journal = {Commun. ACM}, number = {2}, volume = {53}, year = {2010}, bibsource = {DBLP, http://dblp.uni-trier.de}, pages = {97-104}, doi = {10.1145/1646353.1646379}, } @article{aic, title = {Near-optimal hashing algorithms for approximate nearest neighbor in high dimensions}, author = {Alexandr Andoni and Piotr Indyk}, journal = {Commun. ACM}, number = {1}, volume = {51}, year = {2008}, bibsource = {DBLP, http://dblp.uni-trier.de}, pages = {117-122}, doi = {10.1145/1327452.1327494}, } @comment{conference version*} @inproceedings{aic-conference, title = {Near-Optimal Hashing Algorithms for Approximate Nearest Neighbor in High Dimensions}, author = {Alexandr Andoni and Piotr Indyk}, crossref = {pfocs06}, bibsource = {DBLP, http://dblp.uni-trier.de}, pages = {459-468}, doi = {10.1109/FOCS.2006.49}, } @comment{page numbers were missing (LB fixed)***} @article{amm-sttan-09, title = {Space-time tradeoffs for approximate nearest neighbor searching}, author = {Sunil Arya and Theocharis Malamatos and David M. Mount}, journal = JACM, number = {1}, volume = {57}, pages = {1:1--1:54}, year = {2009}, bibsource = {DBLP, http://dblp.uni-trier.de}, doi = {10.1145/1613676.1613677}, } @article{be, title = {Approximate Closest-Point Queries in High Dimensions}, author = {Marshall W. Bern}, journal = ipl, number = {2}, volume = {45}, year = {1993}, bibsource = {DBLP, http://dblp.uni-trier.de}, pages = {95-99}, doi = {10.1016/0020-0190(93)90222-U}, } @article{buh, title = {Efficient large-scale sequence comparison by locality-sensitive hashing}, author = {Jeremy Buhler}, journal = {Bioinformatics}, number = {5}, volume = {17}, year = {2001}, bibsource = {DBLP, http://dblp.uni-trier.de}, pages = {419-428}, doi = {10.1093/bioinformatics/17.5.419}, } @comment{prelim in STOC'92 (DR fixed) ***} @article{ck-dmpsa-95, title = {A Decomposition of Multidimensional Point Sets with Applications to $k$-Nearest-Neighbors and $n$-Body Potential Fields}, author = {Paul B. Callahan and S. Rao Kosaraju}, journal = JACM, number = {1}, volume = {42}, year = {1995}, bibsource = {DBLP, http://dblp.uni-trier.de}, pages = {67-90}, note = {Preliminary version in \href{http://dx.doi.org/10.1145/129712.129766}{STOC'92}}, doi = {10.1145/200836.200853}, } @article{ck-ulam, title = {Embedding the {U}lam metric into $\ell_1$}, author = {Moses Charikar and Robert Krauthgamer}, journal = {Theory of Computing}, number = {1}, volume = {2}, year = {2006}, bibsource = {DBLP, http://dblp.uni-trier.de}, pages = {207-224}, doi = {10.4086/toc.2006.v002a011}, } @article{cl1, title = {A Randomized Algorithm for Closest-Point Queries}, author = {Kenneth L. Clarkson}, journal = SIAMJComput, number = {4}, volume = {17}, year = {1988}, bibsource = {DBLP, http://dblp.uni-trier.de}, pages = {830-847}, doi = {10.1137/0217052}, } @article{dgjc, title = {Scalable Partitioning and Exploration of Chemical Spaces Using Geometric Hashing}, author = {Debojyoti Dutta and Rajarshi Guha and Peter C. Jurs and Ting Chen}, journal = {Journal of Chemical Information and Modeling}, number = {1}, volume = {46}, year = {2006}, bibsource = {DBLP, http://dblp.uni-trier.de}, pages = {321-333}, doi = {10.1021/ci050403o}, } @Book{h-gaa-11, author = {Sariel Har-Peled}, title = {Geometric Approximation Algorithms}, publisher = {Amer. Math. Soc.}, year = 2011 } @article{js, title = {Embedding $l^m_p$ into $l^n_1$}, author = {William B. Johnson and Gideon Schechtman}, journal = {Acta Mathematica}, volume = {149}, year = {1982}, pages = {71--85}, doi = {10.1007/BF02392350}, } @article{lt, title = {Applications of a Planar Separator Theorem}, author = {Richard J. Lipton and Robert Endre Tarjan}, journal = SIAMJComput, number = {3}, volume = {9}, year = {1980}, bibsource = {DBLP, http://dblp.uni-trier.de}, pages = {615-627}, doi = {10.1137/0209046}, } @article{me, title = {Point Location in Arrangements of Hyperplanes}, author = {Stefan Meiser}, journal = InformandComput, number = {2}, volume = {106}, year = {1993}, bibsource = {DBLP, http://dblp.uni-trier.de}, pages = {286-303}, doi = {10.1006/inco.1993.1057}, } @article{prr, title = {The Light Bulb Problem}, author = {Ramamohan Paturi and Sanguthevar Rajasekaran and John Reif}, note = {Preliminary version in \href{http://dl.acm.org/citation.cfm?id=93363}{COLT'89}}, journal = InformandComput, number = {2}, volume = {117}, year = {1995}, bibsource = {DBLP, http://dblp.uni-trier.de}, pages = {187-192}, doi = {10.1006/inco.1995.1038}, } @comment{conference version*} @inproceedings{prr-conference, title = {The Light Bulb Problem}, author = {Ramamohan Paturi and Sanguthevar Rajasekaran and John H. Reif}, booktitle = colt89, year = {1989}, bibsource = {DBLP, http://dblp.uni-trier.de}, pages = {261-268}, eprint = {acm:93363}, } @article{sss-nnspl-06, title = {Nearest neighbors search using point location in balls with applications to approximate {V}oronoi decompositions}, author = {Yogish Sabharwal and Nishant Sharma and Sandeep Sen}, note = {Preliminary version at \href{http://dx.doi.org/10.1007/3-540-36206-1_28}{FSTTCS'02}}, journal = jcss, number = {6}, volume = {72}, year = {2006}, bibsource = {DBLP, http://dblp.uni-trier.de}, pages = {955-977}, doi = {10.1016/j.jcss.2006.01.007}, } @comment{conference version*} @inproceedings{sss-nnspl-06-conference, title = {Nearest Neighbors Search Using Point Location in Balls with Applications to Approximate {V}oronoi Decompositions}, author = {Yogish Sabharwal and Nishant Sharma and Sandeep Sen}, booktitle = {22nd Conf. on Foundations of Software Technology and Theoret. Comput. Sci. (FST TCS'02)}, year = {2002}, bibsource = {DBLP, http://dblp.uni-trier.de}, pages = {311-323}, doi = {10.1007/3-540-36206-1\_28}, } @comment{title misspelled in original: embedding --> embeddings} @comment{missing page numbers; not in ACM DL bibtex; LB added articleno***} @article{or-edit, author = {Rafail Ostrovsky and Yuval Rabani}, title = {Low distortion embeddings for edit distance}, journal = JACM, volume = {54}, number = {5}, articleno = {23}, year = {2007}, doi = {10.1145/1284320.1284322}, note = {Preliminary version in \href{http://dx.doi.org/10.1145/1060590.1060623}{STOC'05}}, bibsource = {DBLP, http://dblp.uni-trier.de} } @comment{conference version*} @inproceedings{or-edit-conference, author = {Rafail Ostrovsky and Yuval Rabani}, title = {Low distortion embeddings for edit distance}, crossref = {pstoc05}, pages = {218-224}, doi = {10.1145/1060590.1060623}, bibsource = {DBLP, http://dblp.uni-trier.de} } @book{nnnips, title = {Nearest Neighbor Methods in Learning and Vision}, publisher = {Neural Processing Information Series, MIT Press}, year = {2006}, editor = {Gregory Shakhnarovich and Trevor Darrell and Piotr Indyk}, } @book{mp, title = {Perceptrons}, author = {Marvin Minsky and Seymour Papert}, publisher = {MIT Press, Cambridge, MA}, year = {1969}, } @book{pis, title = {The volume of convex bodies and Banach space geometry}, author = { Gilles Pisier }, publisher = {Cambridge University Press}, year = {1989}, } @book{clrs, title = {Introduction to Algorithms}, author = {Cormen, Thomas H. and Leiserson, Charles E. and Rivest, Ronald L. and Stein, Clifford}, publisher = {MIT Press}, edition = {2nd}, year = {2001}, } @book{c-phd, title = {Sequence Distance Embeddings}, author = {Graham Cormode}, publisher = {University of Warwick}, series = {Ph.D. Thesis}, year = {2003}, } @incollection{icrc, title = {Nearest Neighbors in High-dimensional Spaces}, author = {Piotr Indyk}, chapter = {39}, publisher = {CRC Press LLC}, url = {http://theory.lcs.mit.edu/~indyk/39.ps}, booktitle = {Handbook of Discrete and Computational Geometry}, edition = {2nd}, editor = {J. E. Goodman and J. O'Rourke}, year = {2004}, pages = {877--892}, } @inproceedings{cms01, title = {Permutation Editing and Matching via Embeddings}, author = {Graham Cormode and S. Muthukrishnan and S{\"u}leyman Cenk Sahinalp}, booktitle = icalp01, year = {2001}, bibsource = {DBLP, http://dblp.uni-trier.de}, pages = {481-492}, doi = {10.1007/3-540-48224-5\_40}, } @inproceedings{pkw, title = {Lower Bounds on Near Neighbor Search via Metric Expansion}, author = {Rina Panigrahy and Kunal Talwar and Udi Wieder}, crossref = {pfocs10}, bibsource = {DBLP, http://dblp.uni-trier.de}, pages = {805-814}, doi = {10.1109/FOCS.2010.82}, } @inproceedings{sh, title = {Closest-Point Problems}, author = {Michael Ian Shamos and Dan Hoey}, crossref = {pfocs75}, bibsource = {DBLP, http://dblp.uni-trier.de}, pages = {151-162}, doi = {10.1109/SFCS.1975.8}, } @inproceedings{gpy, title = {Multi-Index Hashing for Information Retrieval}, author = {Dan Greene and Michal Parnas and Frances Yao}, crossref = {pfocs94}, bibsource = {DBLP, http://dblp.uni-trier.de}, pages = {722-731}, doi = {10.1109/SFCS.1994.365720}, } @comment{au misstated title:"Approximate Nearest Neighbor Searching"**} @comment{David used id "DBLP:conf/soda/AryaM93," instead of "am," } @comment{wrong DOI:same as for item "amnsw"; LB fixed: acm dl ***} @inproceedings{am, author = {Sunil Arya and David M. Mount}, title = {Approximate Nearest Neighbor Queries in Fixed Dimensions}, crossref = {psoda93}, pages = {271-280}, eprint = {acm:313768}, bibsource = {DBLP, http://dblp.uni-trier.de} } @comment{This isn't actually a journal version. Rather, the proceedings of the 6th Int. World Wide Web Conf. were published in this journal issue. Just in case you need it, here's the entry**} @comment{journal version*} @article{bgmz, title = {Syntactic Clustering of the Web}, author = {Andrei Z. Broder and Steven C. Glassman and Mark S. Manasse and Geoffrey Zweig}, journal = {Computer Networks and ISDN Systems}, number = {8-13}, volume = {29}, year = {1997}, bibsource = {DBLP, http://dblp.uni-trier.de}, pages = {1157-1166}, note = {(Proc. 6th Int. World Wide Web Conf. (WWW'97))}, doi = {10.1016/S0169-7552(97)00031-7}, } @inproceedings{chan97-original, title = {Approximate Nearest Neighbor Queries Revisited}, author = {Timothy M. Chan}, booktitle = scg97, year = {1997}, bibsource = {DBLP, http://dblp.uni-trier.de}, pages = {352-358}, doi = {10.1145/262839.263001}, } @comment{journal version*} @article{chan97, title = {Approximate Nearest Neighbor Queries Revisited}, author = {Timothy M. Chan}, journal = DiscreteComputGeom, number = {3}, volume = {20}, year = {1998}, bibsource = {DBLP, http://dblp.uni-trier.de}, pages = {359-373}, doi = {10.1007/PL00009390}, note = {Preliminary version in \href{http://dx.doi.org/10.1145/262839.263001}{SCG'97}}, } @inproceedings{bro-resemblance, title = {On the Resemblance and containment of documents}, author = {Andrei Z. Broder}, booktitle = {Proc. Conf. Compres. Complex. Sequences (CCCS'97)}, year = {1997}, pages = {21--29}, doi = {10.1109/SEQUEN.1997.666900}, } @article{owz-original, title = {Optimal lower bounds for locality sensitive hashing (except when $q$ is tiny)}, author = {Ryan O'Donnell and Yi Wu and Yongi Zhou}, eprint = {arxiv:0912.0250}, year = {2009}, note = {Preliminary version at \href{http://conference.itcs.tsinghua.edu.cn/ICS2011/content/papers/2.html}{ICS'11}}, } @comment{conference version*} @inproceedings{owz, title = {Optimal lower bounds for locality sensitive hashing (except when $q$ is tiny)}, author = {Ryan O'Donnell and Yi Wu and Yuan Zhou}, booktitle = { Proc. 2nd Symp. Innovations in Comput. Sci. (ICS'11)}, year = {2011}, bibsource = {DBLP, http://dblp.uni-trier.de}, pages = {275-283}, note = {\href{http://conference.itcs.tsinghua.edu.cn/ICS2011/content/papers/2.html}{[ICS'11]}, \href{http://arxiv.org/abs/0912.0250}{[arXiv]}}, } @comment{This is the original entry, but it's a link to a page run by Indyk.} @comment{theory.stanford.edu/indyk/nndraft.ps link broken, replaced by BL; it has year 1999 rather than 1998} @article{im2, title = {Approximate nearest neighbors: towards removing the curse of dimensionality}, author = {Piotr Indyk and Rajeev Motwani}, journal = {A final version of the STOC'98 paper, available at \url{http://people.csail.mit.edu/indyk/nndraft.ps}}, year = {1999}, } @inproceedings{web, title = {A Quantitative Analysis and Performance Study for Similarity-Search Methods in High-Dimensional Spaces}, author = {Richard Weber and Hans-J. Schek and Stephen Blott}, booktitle = vldb98, year = {1998}, pages = {194--205}, eprint = {acm:671192} } @comment{DOI broken:10.1145/545381.545400 (LB fixed)***} @comment{Voronoi: name, needs to be capitalized (LB fixed)***} @inproceedings{am-lsavd-02, title = {Linear-size approximate {V}oronoi diagrams}, author = {Sunil Arya and Theocharis Malamatos}, crossref = {psoda02}, bibsource = {DBLP, http://dblp.uni-trier.de}, pages = {147-155}, eprint = {acm:545400}, } @inproceedings{kn-original, title = {Nonembeddability theorems via {Fourier} analysis}, author = {Subhash Khot and Assaf Naor}, crossref = {pfocs05}, bibsource = {DBLP, http://dblp.uni-trier.de}, pages = {101-112}, doi = {10.1109/SFCS.2005.54}, } @comment{journal version*} @comment{"issue 4" won't print --> "number 4" (LB) ***} @article {kn, author = {Subhash Khot and Assaf Naor}, title = {Nonembeddability theorems via {Fourier} analysis}, journal = {Mathematische Annalen}, publisher = springer, pages = {821-852}, volume = {334}, number = {4}, doi = {10.1007/s00208-005-0745-0}, year = {2006}, note = {Preliminary version in \href{http://dx.doi.org/10.1109/SFCS.2005.54}{FOCS'05}} } @comment{Even though the titles are slightly different, I have investigated and confirmed that the journal version is an updated version of the original entry.} @inproceedings{amnsw-original, title = {An Optimal Algorithm for Approximate Nearest Neighbor Searching}, author = {Sunil Arya and David M. Mount and Nathan S. Netanyahu and Ruth Silverman and Angela Y. Wu}, crossref = {psoda94}, bibsource = {DBLP, http://dblp.uni-trier.de}, pages = {573-582}, doi = {10.1145/314464.314652}, } @comment{journal version*} @comment{SODA link broken 10.1145/314464.314652 (LB fixed) ***} @article{amnsw, title = {An Optimal Algorithm for Approximate Nearest Neighbor Searching in Fixed Dimensions}, author = {Sunil Arya and David M. Mount and Nathan S. Netanyahu and Ruth Silverman and Angela Y. Wu}, journal = JACM, number = {6}, volume = {45}, year = {1998}, bibsource = {DBLP, http://dblp.uni-trier.de}, pages = {891-923}, doi = {10.1145/293347.293348}, note = {Preliminary version in \href{http://dl.acm.org/citation.cfm?id=314652}{SODA'94}}, } @inproceedings{gd-kernel-original, title = {The Pyramid Match Kernel: Discriminative Classification with Sets of Image Features}, author = {Kristen Grauman and Trevor Darrell}, booktitle = {10th IEEE Internat. Conf. Comput. Vision (ICCV'05)}, year = {2005}, bibsource = {DBLP, http://dblp.uni-trier.de}, pages = {1458-1465}, doi = {10.1109/ICCV.2005.239}, } @comment{journal version (found by Yishay) ***} @article{gd-kernel, author = {Kristen Grauman and Trevor Darrell}, title = {The Pyramid Match Kernel: Efficient Learning with Sets of Features}, journal = {J. Machine Learning Research}, volume = {8}, year = {2007}, pages = {725-760}, eprint = {acm:1314524}, bibsource = {DBLP, http://dblp.uni-trier.de}, note = {Preliminary version in \href{http://dx.doi.org/10.1109/ICCV.2005.239}{ICCV'05}} } @comment{ACM DL entry found by LB**} @inproceedings{rph, title = {Randomized Algorithms and {NLP}: Using Locality Sensitive Hash Functions for High Speed Noun Clustering}, author = {Deepak Ravichandran and Patrick Pantel and Eduard Hovy}, booktitle = {Proc. Conf. 43rd Ann. Meeting of the Association for Computational Linguistics (ACL'05)}, year = {2005}, bibsource = {DBLP, http://dblp.uni-trier.de}, eprint = {acm:1219917}, } @inproceedings{ai, title = {Near-Optimal Hashing Algorithms for Approximate Nearest Neighbor in High Dimensions}, author = {Alexandr Andoni and Piotr Indyk}, crossref = {pfocs06}, bibsource = {DBLP, http://dblp.uni-trier.de}, pages = {459-468}, doi = {10.1109/FOCS.2006.49}, } @comment{DOI broken 10.1145/1347082.1347120 (LB fixed: eprint) ***} @inproceedings{aik, title = {Earth mover distance over high-dimensional spaces}, author = {Alexandr Andoni and Piotr Indyk and Robert Krauthgamer}, crossref = {psoda08}, bibsource = {DBLP, http://dblp.uni-trier.de}, pages = {343-352}, eprint = {acm:1347082.1347120}, } @comment{Patrascu: accents **** (LB added)} @inproceedings{aip, title = {On the Optimality of the Dimensionality Reduction Method}, author = {Alexandr Andoni and Piotr Indyk and Mihai P{\u a}tra{\c s}cu}, crossref = {pfocs06}, bibsource = {DBLP, http://dblp.uni-trier.de}, pages = {449-458}, doi = {10.1109/FOCS.2006.56}, } @inproceedings{boru-original, title = {Subquadratic Approximation Algorithms for Clustering Problems in High Dimensional Spaces}, author = {Allan Borodin and Rafail Ostrovsky and Yuval Rabani}, crossref = {pstoc99}, bibsource = {DBLP, http://dblp.uni-trier.de}, pages = {435-444}, doi = {10.1145/301250.301367}, } @comment{journal version*} @article{boru, title = {Subquadratic Approximation Algorithms for Clustering Problems in High Dimensional Spaces}, author = {Allan Borodin and Rafail Ostrovsky and Yuval Rabani}, journal = {Machine Learning}, number = {1-3}, volume = {56}, year = {2004}, bibsource = {DBLP, http://dblp.uni-trier.de}, pages = {153-167}, doi = {10.1023/B:MACH.0000033118.09057.80}, note = {Preliminary version in \href{http://dx.doi.org/10.1145/301250.301367}{STOC'99}} } @inproceedings{bt-original, title = {Finding motifs using random projections}, author = {Jeremy Buhler and Martin Tompa}, booktitle = { Proc. 5th Ann. Internat. Conf. on Computational Biology (RECOMB'01)}, year = {2001}, bibsource = {DBLP, http://dblp.uni-trier.de}, pages = {69-76}, doi = {10.1145/369133.369172}, } @comment{journal version*} @article{bt, title = {Finding Motifs Using Random Projections}, author = {Jeremy Buhler and Martin Tompa}, journal = {J. Computational Biology}, number = {2}, volume = {9}, year = {2002}, bibsource = {DBLP, http://dblp.uni-trier.de}, pages = {225-242}, doi = {10.1089/10665270252935430}, note = {Preliminary version in \href{http://dx.doi.org/10.1145/369133.369172}{RECOMB'01}}, } @inproceedings{char, title = {Similarity estimation techniques from rounding algorithms}, author = {Moses S. Charikar}, crossref = {pstoc02}, bibsource = {DBLP, http://dblp.uni-trier.de}, pages = {380-388}, doi = {10.1145/509907.509965}, } @inproceedings{crig, title = {{FLASH}: A Fast Look-Up Algorithm for String Homology}, author = {Andrea Califano and Isidore Rigoutsos}, booktitle = {Proc. 1st Int. Conf. on Intelligent Systems for Molecular Biology (ISMB'93)}, year = {1993}, bibsource = {DBLP, http://dblp.uni-trier.de}, pages = {56-64}, eprint = {acm:645630.662865}, } @comment{republished in other conference *** } @inproceedings{crig-CVPR, title = {{FLASH}: A Fast Look-Up Algorithm for String Homology}, author = {Andrea Califano and Isidore Rigoutsos}, booktitle = {(CVPR'93)}, year = {1993}, pages = {353-359}, doi = {10.1109/CVPR.1993.341106}, } @inproceedings{diim, title = {Locality-sensitive hashing scheme based on $p$-stable distributions}, author = {Mayur Datar and Nicole Immorlica and Piotr Indyk and Vahab S. Mirrokni}, booktitle = scg04, year = {2004}, bibsource = {DBLP, http://dblp.uni-trier.de}, pages = {253-262}, doi = {10.1145/997817.997857}, } @comment{prev version:Scalable Techniques for Clustering the Web - replaced by article below as per Piotr 7-15, note au not alphabetic****}, @inproceedings{hgi, title = {Evaluating strategies for similarity search on the web}, author = {Taher H. Haveliwala and Aristides Gionis and Dan Klein and Piotr Indyk}, booktitle = {Proc. 11th Internat. Conf. on World Wide Web (WWW'02)}, year = {2002}, bibsource = {DBLP, http://dblp.uni-trier.de}, pages = {432-442}, publisher = acm, doi = {10.1145/511446.511502}, } @inproceedings{hp, title = {A Replacement for {V}oronoi Diagrams of Near Linear Size}, author = {Sariel Har-Peled}, crossref = {pfocs01}, bibsource = {DBLP, http://dblp.uni-trier.de}, pages = {94-103}, doi = {10.1109/SFCS.2001.959884}, } @comment{title misspelled in original} @inproceedings{hm, author = {Sariel Har-Peled and Soham Mazumdar}, title = {On coresets for $k$-means and $k$-median clustering}, crossref = {pstoc04}, pages = {291-300}, doi = {10.1145/1007352.1007400}, bibsource = {DBLP, http://dblp.uni-trier.de} } @inproceedings{im, author = {Piotr Indyk and Rajeev Motwani}, title = {Approximate Nearest Neighbors: Towards Removing the Curse of Dimensionality}, crossref = {pstoc98}, pages = {604-613}, doi = {10.1145/276698.276876}, bibsource = {DBLP, http://dblp.uni-trier.de} } @comment{Could not find published anywhere. Only source was this link on author's personal site: people.csail.mit.edu/indyk/emd.pdf**} @inproceedings{it, title = {Fast color image retrieval via embeddings}, author = {Piotr Indyk and Nitin Thaper}, booktitle = {Work. Statis. Comput. Theo. Vision}, note = {Held at ICCV'03. \href{http://people.csail.mit.edu/indyk/emd.pdf}{[PDF]}}, year = {2003}, } @inproceedings{kl, title = {Two Algorithms for Nearest-Neighbor Search in High Dimensions}, author = {Jon M. Kleinberg}, crossref = {pstoc97}, bibsource = {DBLP, http://dblp.uni-trier.de}, pages = {599-608}, doi = {10.1145/258533.258653}, } @inproceedings{kor-original, title = {Efficient Search for Approximate Nearest Neighbor in High Dimensional Spaces}, author = {Eyal Kushilevitz and Rafail Ostrovsky and Yuval Rabani}, crossref = {pstoc98}, bibsource = {DBLP, http://dblp.uni-trier.de}, pages = {614-623}, doi = {10.1145/276698.276877}, } @comment{journal version*} @article{kor, title = {Efficient Search for Approximate Nearest Neighbor in High Dimensional Spaces}, author = {Eyal Kushilevitz and Rafail Ostrovsky and Yuval Rabani}, journal = SIAMJComput, number = {2}, volume = {30}, year = {2000}, bibsource = {DBLP, http://dblp.uni-trier.de}, pages = {457-474}, doi = {10.1137/S0097539798347177}, note = {Preliminary version at \href{http://dx.doi.org/10.1145/276698.276877}{STOC'98}} } @inproceedings{kwz, title = {The Bit Vector Intersection Problem}, author = {Richard M. Karp and Orli Waarts and Geoffrey Zweig}, crossref = {pfocs95}, bibsource = {DBLP, http://dblp.uni-trier.de}, pages = {621-630}, doi = {10.1109/SFCS.1995.492663}, } @inproceedings{llr-original, title = {The geometry of graphs and some of its algorithmic applications}, author = {Nathan Linial and Eran London and Yuri Rabinovich}, crossref = {pfocs94}, bibsource = {DBLP, http://dblp.uni-trier.de}, pages = {577-591}, doi = {10.1109/SFCS.1994.365733}, } @comment{journal version*} @article{llr, title = {The Geometry of Graphs and Some of its Algorithmic Applications}, author = {Nathan Linial and Eran London and Yuri Rabinovich}, journal = combinatorica, number = {2}, volume = {15}, year = {1995}, bibsource = {DBLP, http://dblp.uni-trier.de}, pages = {215-245}, doi = {10.1007/BF01200757}, note = {Preliminary version in \href{http://dx.doi.org/10.1109/SFCS.1994.365733}{FOCS'94}} } @inproceedings{mnp-original, title = {Lower bounds on locality sensitive hashing}, author = {Rajeev Motwani and Assaf Naor and Rina Panigrahy}, booktitle = scg06, year = {2006}, bibsource = {DBLP, http://dblp.uni-trier.de}, pages = {154-157}, doi = {10.1145/1137856.1137881}, } @comment{SoCG --> SCG*** (LB fixed)} @comment{journal version*} @article{mnp, title = {Lower Bounds on Locality Sensitive Hashing}, author = {Rajeev Motwani and Assaf Naor and Rina Panigrahy}, journal = SIAMJDiscreteMath, number = {4}, volume = {21}, year = {2007}, bibsource = {DBLP, http://dblp.uni-trier.de}, pages = {930-935}, doi = {10.1137/050646858}, note = {Preliminary version at \href{http://dx.doi.org/10.1145/1137856.1137881}{SCG'06}} } @inproceedings{msah, title = {Approximate nearest neighbors and sequence comparison with block operations}, author = {S. Muthukrishnan and S{\"u}leyman Cenk Sahinalp}, crossref = {pstoc00}, bibsource = {DBLP, http://dblp.uni-trier.de}, pages = {416-424}, doi = {10.1145/335305.335353}, } @inproceedings{pan, author = {Rina Panigrahy}, title = {Entropy based nearest neighbor search in high dimensions}, crossref = {psoda06}, pages = {1186-1195}, doi = {10.1145/1109557.1109688}, bibsource = {DBLP, http://dblp.uni-trier.de} } @proceedings{pstoc97, booktitle=stoc97, year={1997}, publisher=acm, } @proceedings{pstoc98, booktitle=stoc98, year={1998}, publisher=acm, } @proceedings{pstoc99, booktitle=stoc99, year={1999}, publisher=acm, } @proceedings{pstoc00, booktitle=stoc00, year={2000}, publisher=acm, } @proceedings{pstoc02, booktitle=stoc02, year={2002}, publisher=acm, } @proceedings{pstoc04, booktitle=stoc04, year={2004}, publisher=acm, } @proceedings{pstoc05, booktitle=stoc05, year={2005}, publisher=acm, } @proceedings{pfocs75, booktitle=focs75, year={1975}, publisher=ieee, } @proceedings{pfocs94, booktitle=focs94, year={1994}, publisher=ieee, } @proceedings{pfocs95, booktitle=focs95, year={1995}, publisher=ieee, } @proceedings{pfocs01, booktitle=focs01, year={2001}, publisher=ieee, } @proceedings{pfocs05, booktitle=focs05, year={2005}, publisher=ieee, } @proceedings{pfocs06, booktitle=focs06, year={2006}, publisher=ieee, } @proceedings{pfocs10, booktitle=focs10, year={2010}, publisher=ieee, } @proceedings{psoda93, booktitle=soda93, year={1993}, publisher=acm, } @proceedings{psoda94, booktitle=soda94, year={1994}, publisher=acm, } @proceedings{psoda02, booktitle=soda02, year={2002}, publisher=acm, } @proceedings{psoda06, booktitle=soda06, year={2006}, publisher=acm, } @proceedings{psoda08, booktitle=soda08, year={2008}, publisher=acm, } %%%%%%%%%%%%%%%%%%%%%%%%%% %%%%% bib of v008a015 %%%%%%%%%%%%%%%%%%%%%%%%%% @comment{finished all entries. There are a few compile errors} @comment{Publishers} @string{acm = "ACM Press"} @string{ieee = "IEEE Comp. Soc. Press"} @string{ams = "Amer. Math. Soc."} @string{springer = "Springer"} @comment{Journal abbreviations} @comment{Journal of Discrete Algorithms} @string{JDA="J. Discrete Algorithms"} @comment{Journal of the ACM} @string{JACM="J. ACM"} @comment{SIAM Journal on Computing} @string{SIAMJComput="SIAM J. Comput."} @comment{Theoretical Computer Science} @string{tcs = "Theoret. Comput. Sci."} @comment{other often cited journals listed alphabetically} @comment{Algorithmica} @string{Algorithmica="Algorithmica"} @comment{Discrete & Computational Geometry} @string{DiscreteComputGeom="Discrete Comput. Geom."} @comment{Journal of Computer and System Sciences} @string{JComputSystemSci="J. Comput. System Sci."} @string{jcss="J. Comput. System Sci."} @comment{Mathematics of Operations Research} @string{MathOperRes = "Math. Oper. Res."} @comment{SIAM Journal on Optimization} @string{SIAMJOptim="SIAM J. Optim."} @comment{SIAM Journal on Scientific Computing} @string{SIAMJSciComput="SIAM J. Sci. Comput."} @comment{Conferences} @string{stoc98="Proc. 30th STOC"} @string{stoc01="Proc. 33rd STOC"} @string{stoc03="Proc. 35th STOC"} @string{stoc10="Proc. 42nd STOC"} @string{focs84="Proc. 25th FOCS"} @string{focs96="Proc. 37th FOCS"} @string{focs97="Proc. 38th FOCS"} @string{focs98="Proc. 39th FOCS"} @string{focs00="Proc. 41st FOCS"} @string{focs04="Proc. 45th FOCS"} @string{focs09="Proc. 50th FOCS"} @string{focs10="Proc. 51st FOCS"} @string{soda=" Ann. ACM-SIAM Symp. on Discrete Algorithms"} @string{soda97= "Proc. 8th" # soda # " (SODA'97)"} @string{soda03= "Proc. 14th" # soda # " (SODA'03)"} @string{soda06= "Proc. 17th" # soda # " (SODA'06)"} @string{approx=" Internat. Workshop on Approximation Algorithms for Combinatorial Optimization Problems"} @string{approx02= "Proc. 5th" # approx # " (APPROX'02)"} @string{approx04= "Proc. 7th" # approx # " (APPROX'04)"} @string{icalp=" Internat. Colloq. on Automata, Languages and Programming"} @string{icalp10= "Proc. 37th" # icalp # " (ICALP'10)"} @string{ipco= "Ann. Conf. on Integer Programming and Combinatorial Optimization"} @string{ipco02= "Proc. 9th " # ipco # " (IPCO '02)"} @string{esa= "Ann. European Symp. on Algorithms"} @string{esa99= "Proc. 7th " # esa # " (ESA'99)"} @string{esa08= "Proc. 16th " # esa # " (ESA'08)"} @string{swat04="Proc. 9th Scandinavian Workshop on Algorithm Theory (SWAT '04)"}, @Article{fredman1987fibonacci, author = "Fredman, Michael L. and Tarjan, Robert Endre", title = "{F}ibonacci heaps and their uses in improved network optimization algorithms", journal = JACM, year = "1987", volume = "34", pages = "596--615", doi = {10.1145/28869.28874}, note = {Preliminary version in \href{http://dx.doi.org/10.1109/SFCS.1984.715934}{FOCS'84}}, } @comment{conference version added by Ben*} @InProceedings{fredman1987fibonacciconf, author ="Fredman, Michael L. and Tarjan, Robert Endre", title = "{F}ibonacci heaps and their uses in improved network optimization algorithms", pages = "388--346", crossref = {pfocs84}, doi = {10.1109/SFCS.1984.715934}, } @InProceedings{andrews2004hardness, author ="Andrews, Matthew", title = "Hardness of buy-at-bulk network design", pages = "115--124", crossref = {pfocs04}, doi = {10.1109/FOCS.2004.32}, } @InProceedings{byrka2010improved, author ="Byrka, Jaroslaw and Grandoni, Fabrizio and Rothvo{\ss}, Thomas and Sanit{\`a}, Laura", title = "An improved {LP}-based approximation for {S}teiner tree", pages = "583--592", crossref = {pstoc10}, doi = {10.1145/1806689.1806769}, } @InProceedings{grandoni2010network, author ="Grandoni, Fabrizio and Rothvo{\ss}, Thomas", title = "Network Design via Core Detouring for Problems without a Core", pages = "490--502", crossref = {picalp10}, doi = {10.1007/978-3-642-14165-2\_42}, } @InProceedings{goel2003soc-conf, author ="Goel, Ashish and Estrin, Deborah", title = "Simultaneous optimization for concave costs: single sink aggregation or single source buy-at-bulk", pages = "499--505", crossref = {psoda03}, eprint = {acm:644191}, } @comment{journal version added by Ben*} @Article{goel2003soc, author = "Goel, Ashish and Estrin, Deborah", title = "Simultaneous optimization for concave costs: single sink aggregation or single source buy-at-bulk", journal = Algorithmica, year = "2005", volume = "43", number = "1", pages = "5-15", doi = {10.1007/s00453-005-1155-0}, note = {Preliminary version in \href{http://dl.acm.org/citation.cfm?id=644191}{SODA'03}} } @InProceedings{goel2009oblivious, author ="Goel, Ashish and Post, Ian", title = "An oblivious {O(1)}-approximation for single source buy-at-bulk", pages = "442-450", crossref = {pfocs09}, doi = {10.1109/FOCS.2009.41}, } @InProceedings{goel2010simultaneous, author ="Goel, Ashish and Post, Ian", title = "One Tree Suffices: A Simultaneous {O(1)}-Approximation for Single-Sink Buy-at-Bulk", pages = "593--600", crossref = {pfocs10}, doi = {10.1109/FOCS.2010.62}, } @InProceedings{salman1997bbn, author ="Salman, F. S. and Cheriyan, J. and Ravi, R. and Subramanian, S.", title = "Buy-at-bulk network design: Approximating the single-sink edge installation problem", pages = "619--628", crossref = {psoda97}, eprint = {acm:314397}, } @comment{journal version of above??? ***} @Article{salman1997bbn-journal, author = "Salman, F. S. and Cheriyan, J. and Ravi, R. and Subramanian, S.", title = "Approximating the Single-Sink Link-Installation Problem in Network Design", journal = SIAMJOptim, year = "2001", volume = "11", number = "3", pages = "595--610", doi = {10.1137/S1052623497321432}, } @InProceedings{awerbuch1997bbn, author ="Awerbuch, Baruch and Azar, Yossi", title = "Buy-at-bulk network design", pages = "542--547", crossref = {pfocs97}, doi = {10.1109/SFCS.1997.646143}, } @InProceedings{bartal1998aam, author ="Bartal, Yair", title = "On approximating arbitrary metrics by tree metrics", pages = "161--168", crossref = {pstoc98}, doi = {10.1145/276698.276725}, } @InProceedings{Bartal96probabilistic, author ="Bartal, Yair", title = "Probabilistic Approximation of Metric Spaces and its Algorithmic Applications", pages = "184--193", crossref = {pfocs96}, doi = {10.1109/SFCS.1996.548477}, } @InProceedings{fakcharoenphol2003tba-original, author ="Fakcharoenphol, Jittat and Rao, Satish and Talwar, Kunal", title = "A tight bound on approximating arbitrary metrics by tree metrics", pages = "448--455", crossref = {pstoc03}, doi = {10.1145/780542.780608}, } @comment{journal version added by Ben below*} @Article{fakcharoenphol2003tba, author = "Fakcharoenphol, Jittat and Rao, Satish and Talwar, Kunal", title = "A tight bound on approximating arbitrary metrics by tree metrics", journal = JComputSystemSci, year = "2004", volume = "69", number = "3", pages = "485--497", note = {Preliminary version in \href{http://dx.doi.org/10.1145/780542.780608}{STOC'03}}, doi = {10.1016/j.jcss.2004.04.011}, } @InProceedings{guha2001cfa, author ="Guha, Sudipto and Meyerson, Adam and Munagala, Kamesh", title = "A constant factor approximation for the single sink edge installation problems", pages = "383--388", crossref = {pstoc01}, doi = {10.1145/380752.380827}, } @comment{journal version added below by Ben*} @comment{journal version 9 years after conf: cited as separate publ (LB) ***} @Article{guha2001cfa-journal, author = "Guha, Sudipto and Meyerson, Adam and Munagala, Kamesh", title = "A constant factor approximation for the single sink edge installation problem", journal = SIAMJComput, year = "2010", volume = "38", number = "6", pages = "2426--2442", doi = {10.1137/050643635}, } @InProceedings{talwar2002ssb, author ="Talwar, Kunal", title = "The Single-Sink Buy-at-Bulk {LP} Has Constant Integrality Gap", pages = "475--486", crossref = {pipco02}, doi = {10.1007/3-540-47867-1\_33}, } @Article{gupta2007approximation, author = "Gupta, Anupam and Kumar, Amit and P{\'a}l, Martin and Roughgarden, Tim", title = "Approximation via cost sharing: Simpler and better approximation algorithms for network design", journal = JACM, year = "2007", volume = "54", number = "3", pages = "1--38", doi = {10.1145/1236457.1236458}, } @conference{jothi2004iaa-original, Author = "Jothi, Raja and Raghavachari, Balaji", Booktitle = swat04, Pages = "336--348", Title = "Improved approximation algorithms for the single-sink buy-at-bulk network design problems", Publisher = springer, Volume = "3111", Year = "2004", doi = {10.1007/978-3-540-27810-8\_29}, } @comment{Journal version below added by Ben*} @Article{jothi2004iaa, author = "Jothi, Raja and Raghavachari, Balaji", title = "Improved approximation algorithms for the single-sink buy-at-bulk network design problems", journal = JDA, year = "2009", volume = "7", number = "2", pages = "249--255", note = {Preliminary version in \href{http://dx.doi.org/10.1007/978-3-540-27810-8\_29}{SWAT'04}}, doi = {10.1016/j.jda.2008.12.003}, } @comment{not sure what the abbreviation for Algorithms and Computation is*} @conference{grandoni2006ias, Author = "Grandoni, Fabrizio and Italiano, Giuseppe F.", Pages = "111--120", Publisher = springer, Title = "Improved approximation for single-sink buy-at-bulk", booktitle = "17th Int. Symp. on Algorithms and Computation (ISAAC'06)", Volume = "4288", Year = "2006", doi = {10.1007/11940128\_13}, } @Article{van2009deterministic, author = "van Zuylen, Anke", title = "Deterministic sampling algorithms for network design", journal = Algorithmica, year = "2011", volume = "60", number = "1", pages = "110--151", doi = {10.1007/s00453-009-9344-x}, note = {Preliminary version in \href{http://dx.doi.org/10.1007/978-3-540-87744-8\_69}{ESA'08}}, } @comment{conference version added below by Ben*} @InProceedings{van2009deterministicconf, author ="van Zuylen, Anke", title = "Deterministic Sampling Algorithms for Network Design", pages = "830--841", crossref = {pesa08}, doi = {10.1007/978-3-540-87744-8\_69}, } @Article{khuller1995bms, author = "Khuller, S. and Raghavachari, B. and Young, N.", title = "Balancing minimum spanning trees and shortest-path trees", journal = Algorithmica, year = "1995", volume = "14", number = "4", pages = "305--321", doi = {10.1007/BF01294129}, } @Article{enachescu2005sfa, author = "Enachescu, Mihaela and Goel, Ashish and Govindan, Ramesh and Motwani, Rajeev", title = "Scale-free aggregation in sensor networks", journal = tcs, year = "2005", volume = "344", number = "1", pages = "15--29", doi = {10.1016/j.tcs.2005.06.023}, note = {Preliminary version in \href{http://dx.doi.org/10.1007/978-3-540-27820-7\_8}{ALGOSENSORS'04}}, } @comment{conference version added below by Ben*} @comment{couldn't find abbreviation for Algorithmic Aspects of Wireless Sensor Networks*} @comment{Ben forgot year ***} @conference{enachescu2005sfaconf, author ="Enachescu, Mihaela and Goel, Ashish and Govindan, Ramesh and Motwani, Rajeev", title = "Scale Free Aggregation in Sensor Networks", Booktitle = "Algorithmic Aspects of Wireless Sensor Networks (ALGOSENSORS'04)", publisher = springer, year = "2004", pages = "71--84", doi = {10.1007/978-3-540-27820-7\_8}, } @InProceedings{gupta2006ond, author ="Gupta, Anupam and Hajiaghayi, Mohammad T. and R{\"a}cke, Harald", title = "Oblivious network design", pages = "970--979", crossref = {psoda06}, doi = {10.1145/1109557.1109665}, } @InProceedings{englert2009oblivious, author = "Englert, Matthias and R{\"a}cke, Harald", title = "Oblivious Routing for the {L$_p$}-norm", pages = "32--40", crossref = {pfocs09}, doi = {10.1109/FOCS.2009.52}, } @InProceedings{ravi1999approximation, author = "Ravi, R. and Salman, F. S.", title = "Approximation Algorithms for the Traveling Purchaser Problem and Its Variants in Network Design", pages = "696--696", crossref = {pesa99}, doi = {10.1007/3-540-48481-7\_4}, } @InProceedings{karger2000building, author = "Karger, David R. and Minkoff, Maria", title = "Building {S}teiner trees with incomplete global knowledge", pages = "613--623", crossref = {pfocs00}, doi = {10.1109/SFCS.2000.892329}, } @InProceedings{gupta2001provisioning, author = "Gupta, Anupam and Kleinberg, Jon and Kumar, Amit and Rastogi, Rajeev and Yener, Bulent", title = "Provisioning a virtual private network: A network design problem for multicommodity flow", pages = "389--398", crossref = {pstoc01}, doi = {10.1145/380752.380830}, } @Article{swamy2004primal, author = "Swamy, Chaitanya and Kumar, Amit", title = "Primal-dual algorithms for connected facility location problems", journal = Algorithmica, year = "2004", volume = "40", number = "4", pages = "245--269", doi = {10.1007/s00453-004-1112-3}, note = {Preliminary version in \href{http://dx.doi.org/10.1007/3-540-45753-4\_22}{APPROX'02}}, } @comment{conference version added below by Ben*} @InProceedings{swamy2004primal-conf, author = "Swamy, Chaitanya and Kumar, Amit", title = "Primal-dual algorithms for connected facility location problems", pages = "256--270", crossref = {papprox02}, doi = {10.1007/3-540-45753-4\_22}, } @Article{gupta2008cost, author = "Gupta, Anupam and Srinivasan, Aravind and Tardos, {\'E}va", title = "Cost-sharing mechanisms for network design", journal = Algorithmica, year = "2008", volume = "50", number = "1", pages = "98--119", doi = {10.1007/s00453-007-9065-y}, note = {Preliminary version in \href{http://dx.doi.org/10.1007/978-3-540-27821-4\_13}{APPROX'04}}, } @comment{conference version added below by Ben*} @InProceedings{gupta2008cost-conf, author = "Gupta, Anupam and Srinivasan, Aravind and Tardos, {\'E}va", title = "Cost-sharing mechanisms for network design", pages = "139--150", crossref = {papprox04}, doi = {10.1007/978-3-540-27821-4\_13}, } @Article{williamson2007simpler, author = "Williamson, David P. and van Zuylen, Anke", title = "A simpler and better derandomization of an approximation algorithm for single source rent-or-buy", journal = "Oper. Res. Lett.", year = "2007", volume = "35", number = "6", pages = "702--712", doi = {10.1016/j.orl.2007.02.005}, } @Article{eisenbrand2010connected, author = "Eisenbrand, Friedrich and Grandoni, Fabrizio and Rothvo{\ss}, Thomas and Sch{\"a}fer, Guido", title = "Connected facility location via random facility sampling and core detouring", journal = JComputSystemSci, year = "2010", volume = "76", number = "8", pages = "709--726", doi = {10.1016/j.jcss.2010.02.001}, } @InProceedings{andrews1998access, author = "Andrews, Matthew and Zhang, Lisa", title = "The access network design problem", pages = "40--49", crossref = {pfocs98}, doi = {10.1109/SFCS.1998.743427}, } @comment{can't find DOI for entry below*} @techreport{krishnamachari2002modelling, author = "Krishnamachari, Bhaskar and Estrin, Deborah and Wicker, Stephen", title = "Modelling data-centric routing in wireless sensor networks", year = "2002", institution = "Univ. Southern Calif. Dept. EE - Systems (18 pp)", number = "CENG 02-14", note = {\href{http://lecs.cs.ucla.edu/Publications/papers/Bhaskar-DataCentric.pdf}{PDF}}, } @Article{rabinovich1998lower, author = "Rabinovich, Y. and Raz, R.", title = "Lower bounds on the distortion of embedding finite metric spaces in graphs", journal = DiscreteComputGeom, year = "1998", volume = "19", number = "1", pages = "79--94", doi = {10.1007/PL00009336}, } @Proceedings{pipco02, booktitle = ipco02, year = 2002, publisher = springer, } @Proceedings{psoda97, booktitle = soda97, year = 1997, publisher = acm, } @Proceedings{psoda03, booktitle = soda03, year = 2003, publisher = acm, } @Proceedings{psoda06, booktitle = soda06, year = 2006, publisher = acm, } @Proceedings{picalp10, booktitle = icalp10, year = 2010, publisher = springer, } @Proceedings{pstoc98, booktitle = stoc98, year = 1998, publisher = acm, } @Proceedings{pstoc01, booktitle = stoc01, year = 2001, publisher = acm, } @Proceedings{pstoc03, booktitle = stoc03, year = 2003, publisher = acm, } @Proceedings{pstoc10, booktitle = stoc10, year = 2010, publisher = acm, } @Proceedings{pfocs84, booktitle = focs84, year = 1984, publisher = ieee, } @Proceedings{pfocs96, booktitle = focs96, year = 1996, publisher = ieee, } @Proceedings{pfocs97, booktitle = focs97, year = 1997, publisher = ieee, } @Proceedings{pfocs98, booktitle = focs98, year = 1998, publisher = ieee, } @Proceedings{pfocs00, booktitle = focs00, year = 2000, publisher = ieee, } @Proceedings{pfocs04, booktitle = focs04, year = 2004, publisher = ieee, } @Proceedings{pfocs09, booktitle = focs09, year = 2009, publisher = ieee, } @Proceedings{pfocs10, booktitle = focs10, year = 2010, publisher = ieee, } @Proceedings{pesa99, booktitle = esa99, year = 1999, publisher = springer, } @Proceedings{pesa08, booktitle = esa08, year = 2008, publisher = springer, } @Proceedings{papprox02, booktitle = approx02, year = 2002, publisher = springer, } @Proceedings{papprox04, booktitle = approx04, year = 2004, publisher = springer, } %%%%%%%%%%%%%%%%%%%%%%%%%% %%%%% bib of v008a016 %%%%%%%%%%%%%%%%%%%%%%%%%% @string{acm = "ACM Press"} @string{ieee = "IEEE Comp. Soc. Press"} @string{springer = "Springer"} @string{JACM="J. ACM"} @string{SIAMJComput="SIAM J. Comput."} @string{ipl = "Inform. Process. Lett."} @string{jcss="J. Comput. System Sci."} @string{stoc93="Proc. 25th STOC"} @string{stoc03="Proc. 35th STOC"} @string{focs95="Proc. 36th FOCS"} @string{focs99="Proc. 40th FOCS"} @string{stacs=" Symp. Theoretical Aspects of Comp. Sci."} @string{stacs02= "Proc. 19th" # stacs # " (STACS'02)"} @article{bernstein+sicomp97, title = {Quantum Complexity Theory}, author = {Ethan Bernstein and Umesh Vazirani}, note = {Preliminary version in \href{http://dx.doi.org/10.1145/167088.167097}{STOC'93}}, journal = SIAMJComput, number = {5}, volume = {26}, year = {1997}, bibsource = {DBLP, http://dblp.uni-trier.de}, pages = {1411-1473}, doi = {10.1137/S0097539796300921}, } @comment{conference version*} @inproceedings{bernstein+sicomp97-conference, title = {Quantum complexity theory}, author = {Ethan Bernstein and Umesh V. Vazirani}, crossref = {pstoc93}, bibsource = {DBLP, http://dblp.uni-trier.de}, pages = {11-20}, doi = {10.1145/167088.167097}, } @inproceedings{nayakfocs99, title = {Optimal Lower Bounds for Quantum Automata and Random Access Codes}, author = {Ashwin Nayak}, crossref = {pfocs99}, bibsource = {DBLP, http://dblp.uni-trier.de}, pages = {369-377}, doi = {10.1109/SFFCS.1999.814608}, } @article{giovannetti+prl08, title = {Quantum Private Queries}, author = {Vittorio Giovannetti and Seth Lloyd and Lorenzo Maccone}, journal = {Phys. Rev. Lett.}, volume = {100}, issue = {23}, pages = {230502}, numpages = {4}, year = {2008}, month = {Jun}, doi = {10.1103/PhysRevLett.100.230502}, } @article{jain+jacm09, title = {A property of quantum relative entropy with an application to privacy in quantum communication}, author = {Rahul Jain and Jaikumar Radhakrishnan and Pranab Sen}, journal = JACM, number = {6}, volume = {56}, pages = {33}, year = {2009}, bibsource = {DBLP, http://dblp.uni-trier.de}, note = {Preliminary version in \href{http://dl.acm.org/citation.cfm?id=652142}{FOCS'02}}, doi = {10.1145/1568318.1568323}, } @article{klauck04, title = {Quantum and Approximate Privacy}, author = {Hartmut Klauck}, note = {Preliminary version in \href{http://dx.doi.org/10.1007/3-540-45841-7\_27}{STACS'02}}, journal = {Theory of Computing Systems}, number = {1}, volume = {37}, year = {2004}, bibsource = {DBLP, http://dblp.uni-trier.de}, pages = {221-246}, doi = {10.1007/s00224-003-1113-7}, } @comment{conference version*} @inproceedings{klauck04-conference, title = {On Quantum and Approximate Privacy}, author = {Hartmut Klauck}, booktitle = stacs02, publisher = springer, year = {2002}, bibsource = {DBLP, http://dblp.uni-trier.de}, pages = {335-346}, doi = {10.1007/3-540-45841-7\_27}, } @book{nielsen+00, title = {Quantum Computation and Quantum Information}, author = {Michael Nielsen and Isaac Chuang}, publisher = {Cambridge University Press}, date-modified = {2011-07-26 15:25:53 +0900}, year = {2000}, date-added = {2011-04-15 18:52:56 +0900}, } @article{kerenidis+ipl04, title = {Quantum symmetrically-private information retrieval}, author = {Iordanis Kerenidis and Ronald de Wolf}, note = {}, journal = ipl, number = {3}, volume = {90}, year = {2004}, bibsource = {DBLP, http://dblp.uni-trier.de}, pages = {109-114}, doi = {10.1016/j.ipl.2004.02.003}, } @article{chor+jacm98, title = {Private Information Retrieval}, author = {Benny Chor and Oded Goldreich and Eyal Kushilevitz and Madhu Sudan}, note = {Preliminary version in \href{http://dx.doi.org/10.1109/SFCS.1995.492461}{FOCS'95}}, journal = JACM, number = {6}, volume = {45}, year = {1998}, bibsource = {DBLP, http://dblp.uni-trier.de}, pages = {965-981}, doi = {10.1145/293347.293350}, } @comment{conference version*} @inproceedings{chor+jacm98-conference, title = {Private Information Retrieval}, author = {Benny Chor and Oded Goldreich and Eyal Kushilevitz and Madhu Sudan}, crossref = {pfocs95}, bibsource = {DBLP, http://dblp.uni-trier.de}, pages = {41-50}, doi = {10.1109/SFCS.1995.492461}, } @article{kerenidis+jcss04, title = {Exponential lower bound for 2-query locally decodable codes via a quantum argument}, author = {Iordanis Kerenidis and Ronald de Wolf}, note = {Preliminary version in \href{http://dx.doi.org/10.1145/780542.780560}{STOC'03}}, journal = jcss, number = {3}, volume = {69}, year = {2004}, bibsource = {DBLP, http://dblp.uni-trier.de}, pages = {395-420}, doi = {10.1016/j.jcss.2004.04.007}, } @comment{conference version*} @inproceedings{kerenidis+jcss04-conference, title = {Exponential lower bound for 2-query locally decodable codes via a quantum argument}, author = {Iordanis Kerenidis and Ronald de Wolf}, crossref = {pstoc03}, bibsource = {DBLP, http://dblp.uni-trier.de}, pages = {106-115}, doi = {10.1145/780542.780560}, } @proceedings{pstoc93, booktitle = stoc93, publisher = acm, year = {1993} } @proceedings{pstoc03, booktitle = stoc03, publisher = acm, year = {2003} } @proceedings{pfocs95, booktitle = focs95, publisher = ieee, year = {1995} } @proceedings{pfocs99, booktitle = focs99, publisher = ieee, year = {1999} } %%%%%%%%%%%%%%%%%%%%%%%%%% %%%%% bib of v008a017 %%%%%%%%%%%%%%%%%%%%%%%%%% %% ishay 07-24 %% bowei 07-23 %% Theory of Computing %% File: v008a757.bib %% Publication date: July 30, 2012 %% Authors: Rahul Jain, Iordanis Kerenidis, Greg Kuperberg, Miklos Santha, Or Sattah, and Shengyu Zhang @comment{ How to include toc-abbreviations007.bib at the beginning? } @comment{Journals} @string{SIAMJComput="SIAM J. Comput."} @string{AmerJMath="Amer. J. Math."} @string{tcs = "Theoret. Comput. Sci."} @string{ccomplex = "Comput. Complexity"} @string{jcss="J. Comput. System Sci."} @comment{Quantum Information & Computation} @string{QuantumInfComput="Quantum Inf. Comput."} @comment{Conferences} @string{ieee = "IEEE Comp. Soc. Press"} @string{stoc85="Proc. 17th STOC"} @string{sct=" Structure in Complexity Theory Conf."} @string{ccc86="Proc. 1st" # sct # " (1986)"} @string{ccc=" IEEE Conf. on Computational Complexity"} @string{ccc04="Proc. 19th" # ccc # " (CCC'04)"} @string{focs84="Proc. 25th FOCS"} @string{focs00="Proc. 41st FOCS"} @string{focs07="Proc. 48th FOCS"} @string{random=" Internat. Workshop on Randomization and Computation"} @string{random06= "Proc. 10th" # random # " (RANDOM'06)"} @comment{Publishers} @string{acm = "ACM Press"} @string{ieee = "IEEE Comp. Soc. Press"} @string{ams = "Amer. Math. Soc."} @string{cup = "Cambridge Univ. Press"} @string{doklady = "Doklady Akademii Nauk SSSR, N.S."} @string{oup = "Oxford Univ. Press"} @string{springer = "Springer"} @misc{ABBS08, author = {Dorit Aharonov and Michael Ben-Or and Fernando G. S. L. Brand{\~a}o and Or Sattath}, title = "The pursuit for uniqueness: extending {Valiant-Vazirani} theorem to the probabilistic and quantum settings", note = {\href{http://arxiv.org/abs/0810.4840}{arXiv:0810.4840}}, year = 2008 } @comment{added item: conference version of the article below*} @inproceedings{AGIK09conf, author = "Dorit Aharonov and Daniel Gottesman and Sandy Irani and Julia Kempe", title = "The power of quantum systems on a line", crossref = {pfocs07}, pages = "373--383", doi = {10.1109/FOCS.2007.46} } @comment{no string for journal name?**} @comment{ignore author note = "arXiv:0705.4077"} @comment{added conference version above*} @article{AGIK09, author = "Dorit Aharonov and Daniel Gottesman and Sandy Irani and Julia Kempe", title = "The power of quantum systems on a line", journal = "Comm. Math. Phys.", volume = 287, year = 2009, number = 1, pages = "41--65", note = {Preliminary version in \href{http://dx.doi.org/10.1109/FOCS.2007.46}{FOCS'07}}, doi = {10.1007/s00220-008-0710-3} } @comment{instructions for arXiv?**} @comment{added link in note*} @misc{AN02, author = "Dorit Aharonov and Tomer Naveh", title = "Quantum {{\sf NP}} - {A} survey", year = 2002, note = {\href{http://arxiv.org/abs/quant-ph/0210077v1}{arXiv:quant-ph/0210077}} } @comment{[Done]Bowei:ENTER DOI!} @incollection{All86, author = "Eric W. Allender", title = "The complexity of sparse sets in {{\sf P}} (preliminary report)", booktitle = ccc86, series = "Lecture Notes in Comput. Sci.", volume = 223, pages = "1--11", publisher = springer, year = 1986, doi = {10.1007/3-540-16486-3\_85} } @comment{manually found doi} @article{AR88, author = "Eric W. Allender and Roy S. Rubinstein", title = "{{\sf P}}-printable sets", journal = SIAMJComput, volume = 17, year = 1988, number = 6, pages = "1193--1202", doi={10.1137/0217075} } @comment{[Done] Bowei: use crossref, pstoc/pfocs format} @comment{added pages entry} @comment{multiple crossref trouble: crossref = {pstoc85}} @inproceedings{Bab85, author = "L\'aszl\'o Babai", title = "Trading group theory for randomness", booktitle = stoc85, year = 1985, publisher = acm, pages = "421--429", doi = {10.1145/22145.22192} } @article{BBDEJM97, author = "Adriano Barenco and Andr\'e Berthiaume and David Deutsch and Artur Ekert and Richard Jozsa and Chiara Macchiavello", title = "Stabilization of quantum computations by symmetrization", journal = SIAMJComput, volume = 26, year = 1997, number = 5, pages = "1541--1557", doi = {10.1137/S0097539796302452} } @comment{broken doi 10.1007/978-1-4612-0653-8, add note instead} @comment{What entries are requried for book? ISBN?} @comment{originally: publisher = "Springer-Verlag"?} @book{Bhatia, author = "Rajendra Bhatia", title = "Matrix Analysis", series = "Graduate Texts in Mathematics", volume = 169, year = 1997, publisher = springer, note = {\href{http://www.springer.com/mathematics/analysis/book/978-0-387-94846-1}{Springer}} } @comment{no string for journal **} @comment{PRL pages problem again? Same page number on every page of the article} @comment{pages = 167902} @article{BCWW01, author = "Harry Buhrman and Richard Cleve and John Watrous and Ronald de Wolf", title = "Quantum fingerprinting", journal = "Phys. Rev. Lett.", volume = 87, number = 16, year = 2001, note = {\href{http://arxiv.org/abs/quant-ph/0102001}{arXiv:quant-ph/0102001}}, doi = {10.1103/PhysRevLett.87.167902} } @comment{It seems only have preprint version. bibtex warning!} @article{FGGS00, title={Quantum computation by adiabatic evolution}, author= "Edward Farhi and Jeffrey Goldstone and Sam Gutmann and Michael Sipser ", note = {\href{http://arxiv.org/abs/quant-ph/0001106}{arXiv:quant-ph/0001106}}, year={2000} } @comment{added item: conference version for the journal version below*} @comment{[Solved]how many entries should I enter for conference reference? -- added pages} @comment{multiple crossref trouble: crossref = {pstoc85}} @inproceedings{GMR89conf, author = "Shafi Goldwasser and Silvio Micali and Charles Rackoff", title = "The knowledge complexity of interactive proof-systems", booktitle = stoc85, year = 1985, publisher = acm, pages = "291--304", doi = {10.1145/22145.22178} } @comment{added conference version above*} @article{GMR89, author = "Shafi Goldwasser and Silvio Micali and Charles Rackoff", title = "The knowledge complexity of interactive proof systems", journal = SIAMJComput, volume = 18, year = 1989, number = 1, pages = "186--208", doi = {10.1137/0218012}, note={Preliminary version in \href{http://dx.doi.org/10.1145/22145.22178}{STOC'85}} } @comment{added item: conference version of the article below*} @comment{publisher: IEEE?} @inproceedings{GS88conf, author = "Joachim Grollmann and Alan L. Selman", title = "Complexity measures for public-key cryptosystems", crossref = {pfocs84}, pages = "495--503", doi = {10.1109/SFCS.1984.715952} } @comment{added conference version above*} @article{GS88, author = "Joachim Grollmann and Alan L. Selman", title = "Complexity measures for public-key cryptosystems", journal = SIAMJComput, volume = 17, number = 2, year = 1988, pages = "309--335", note = {Preliminary version in \href{http://dx.doi.org/10.1109/SFCS.1984.715952}{FOCS'84}}, doi = {10.1137/0217018} } @comment{no string for journal name?**} @comment{issue 08 = number 8?} @article{Hastings07, title={An area law for one-dimensional quantum systems}, author = "Matthew B. Hastings", journal={J. Statistical Mechanics: Theory and Experiment}, volume={2007}, number = 8, pages={P08024}, year={2007}, note = {\href{http://arxiv.org/abs/0705.2024}{arXiv:0705.2024}}, publisher={IOP Publishing}, doi = {10.1088/1742-5468/2007/08/P08024} } @comment{no string for journal title?**} @comment{prelim version found by Ishay***} @article{HJV93, author = "Lane A. Hemaspaandra and Sanjay Jain and Nikolai K. Vereshchagin", title = "Banishing robust {T}uring completeness", journal = "Internat. J. Found. Comput. Sci.", volume = 4, year = 1993, number = 3, pages = "245--265", note = {Preliminary version in \href{http://dl.acm.org/citation.cfm?id=664106}{LFCS'92}}, doi = {10.1142/S012905419300016X} } @article{H54, author = "Alfred Horn", title = "Doubly stochastic matrices and the diagonal of a rotation matrix", journal = AmerJMath, volume = 76, number = 3, year = 1954, pages = "620--630", doi = {10.2307/2372705} } @comment{only prepring version?} @misc{JWT03, author = "Dominik Janzing and Pavel Wocjan and Thomas Beth", title = "Identity check is {QMA}-complete", note = {\href{http://arxiv.org/abs/quant-ph/0305050}{arXiv:quant-ph/0305050}}, year = 2003 } @comment{manually find doi*} @article{Kay07, author = "Alastair Kay", title = "{Quantum-Merlin-Arthur}-complete translationally invariant {H}amiltonian problem and the complexity of finding ground-state energies in physical systems", journal = "Phys. Rev. A", volume = 76, number = 3, pages = 030307, year = 2007, note = {\href{http://arxiv.org/abs/0704.3142}{arXiv:0704.3142}}, doi = {10.1103/PhysRevA.76.030307} } @comment{added item: conference version of article below*} @comment{no string for conference**} @comment{no string for booktitle?} @inproceedings{KKR06conf, author = "Julia Kempe and Alexei Kitaev and Oded Regev", title = "The complexity of the {Local Hamiltonian} problem", booktitle = "Foundation of Software Technology and Theoretical Computer Science", series = "FSTTCS'04", year = 2004, pages = "372--383", publisher = springer, doi = {10.1007/978-3-540-30538-5\_31} } @comment{added conference version above*} @comment{ignore author note = {\href{http://arxiv.org/abs/quant-ph/0406180}{arXiv:quant-ph/0406180}}} @article{KKR06, author = "Julia Kempe and Alexei Kitaev and Oded Regev", title = "The complexity of the {Local Hamiltonian} problem", journal = SIAMJComput, volume = 35, year = 2006, number = 5, pages = "1070--1097", note = {Preliminary version in \href{http://dx.doi.org/10.1007/978-3-540-30538-5_31}{FSTTCS'04}}, doi ={10.1137/S0097539704445226} } @comment{[Done] Bowei: try AMS website} @comment{only found bookstore page on AMS website} @comment{EXTRA note! Which one to ignore, author's note or additional link?} @comment{nolink for book?} @book{KSV02, author = "Alexei Kitaev and Alexander Shen and Mikhail Vyalyi", title = "Classical and Quantum Computation", series = "Graduate Studies in Mathematics", volume = 47, publisher = ams, year = 2002, note= {Translated from the 1999 Russian original by Lester J. Senechal, \href{http://www.ams.org/bookstore?fn=20&arg1=gsmseries&ikey=GSM-47-S}{AMS}} } @misc{Kni96, author = "Emanuel Knill", title = "Quantum randomness and nondeterminism", note = {\href{http://arxiv.org/abs/quant-ph/9610012}{arXiv:quant-ph/9610012}}, year = 1996 } @article{Ko85, author = "Ker-I Ko", title = "On some natural complete operators", journal = tcs, volume = 37, year = 1985, number = 1, pages = "1--30", doi = {10.1016/0304-3975(85)90085-4} } @comment{found doi in the ACM Digital Library link page} @comment{eprint={acm:150143}} @comment{PP does not print capitals; enclosed in double braces LB***} @article{KSTT92, author = {Johannes K{\"o}bler and Uwe Sch{\"o}ning and Seinosuke Toda and Jacobo Tor{\'a}n}, title = "Turing machines with few accepting computations and low sets for {{\sf PP}}", journal = jcss, volume = 44, year = 1992, number = 2, pages = "272--286", note = {Preliminary version in \href{http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=41826}{Structure In Complexity Theory, 1989}}, doi = {10.1016/0022-0000(92)90022-B} } @comment{no string for series?} @comment{what else entries are required for collection? ISBN?} @comment{RANDOM! ***} @incollection{Liu06LNCS, author = "Yi-Kai Liu", title = "Consistency of local density matrices is {QMA}-complete", booktitle = "Approximation, randomization and combinatorial optimization", series = "Lecture Notes in Comput. Sci.", volume = 4110, pages = "438--449", publisher = springer, year = 2006, note ={\href{http://arxiv.org/abs/quant-ph/0604166}{arXiv:quant-ph/0604166}}, doi = {10.1007/11830924\_40} } @comment{referring to the RANDOM conf***} @inproceedings{Liu06, author = "Yi-Kai Liu", title = "Consistency of local density matrices is {QMA}-complete", booktitle = random06, series = "Lecture Notes in Comput. Sci.", volume = 4110, pages = "438--449", publisher = springer, year = 2006, note ={\href{http://arxiv.org/abs/quant-ph/0604166}{arXiv:quant-ph/0604166}}, doi = {10.1007/11830924\_40} } @comment{changed title to match the databse*} @comment{no string for the journal name?} @comment{PRL pages problem? Journal shows the same page number on every page (110503) in the article} @comment{pages = 110503} @article{LCV07, title = "Quantum Computational Complexity of the {$N$}-representability Problem: {QMA}-complete", author = "Yi-Kai Liu and Matthias Christandl and Frank Verstraete", journal = "Phys. Rev. Lett.", volume = 98, number = 11, year = 2007, note ={\href{http://arxiv.org/abs/quant-ph/0609125}{arXiv:quant-ph/0609125}}, doi = {10.1103/PhysRevLett.98.110503} } @comment{added item: conference version of article below*} @comment{publisher: IEEE?} @comment{no longer needed: series = "CCC'04"} @inproceedings{MW05conf, author = "Chris Marriott and John Watrous", title = "Quantum {Arthur-Merlin} games", booktitle = ccc04, year = 2004, pages = "275--285", publisher = ieee, doi = {10.1109/CCC.2004.1313850} } @comment{added conference version above*} @comment{author's note ={\href{http://arxiv.org/abs/cs/0506068}{arXiv:cs/0506068}} will be ignored by bibtex} @article{MW05, author = "Chris Marriott and John Watrous", title = "Quantum {Arthur-Merlin} games", journal = ccomplex, volume = 14, year = 2005, number = 2, pages = "122--152", note = {Preliminary version in \href{http://dx.doi.org/10.1109/CCC.2004.1313850}{CCC'04}}, doi = {10.1007/s00037-005-0194-x} } @comment{link goes to 10th anniversary version. Use year 2010?*} @comment{title capitalized LB ***} @book{NielsenC00, author = "Michael A. Nielsen and Isaac L. Chuang", title = "Quantum Computation and Quantum Information", publisher = "Cambridge University Press", year = 2000, doi = {10.1017/CBO9780511976667} } @comment{preprint only?} @comment{journal version found by Ishay***} @article{OT05, author = "Roberto Oliveira and Barbara Terhal", title = "The complexity of quantum spin systems on a two-dimensional square lattice", journal = QuantumInfComput, eprint = {acm:2016987}, note ={\href{http://arxiv.org/abs/quant-ph/0504050}{arXiv:quant-ph/0504050}}, year = 2008, volume = 8, number = 10, pages = "900-924", } @comment{manually found doi} @comment{title = "Upward separation for {{\sf FP}} and related classes"} @comment{changed title a bit to match the database version} @article{RRW94, author = {Rajesh P. N. Rao and J\"org Rothe and Osamu Watanabe}, title = "Upward separation for {F}ew{P} and related classes", journal = "Inform. Process. Lett.", volume = 52, number = 4, pages = "175 - 180", year = 1994, doi = {10.1016/0020-0190(94)90123-6} } @comment{Valiant, Vazirani caps LB***} @mastersthesis{Sattath, author = "Or Sattath", title = "The Pursuit Of Uniqueness: Extending {V}aliant-{V}azirani Theorem to the Probabilistic and Quantum Settings", school = "Hebrew University in Jerusalem", year = 2009 } @comment{Bowei: try springer} @comment{manually found doi on springer website} @comment{no link?} @incollection{Tor90, author = "Jacobo Tor\'an", title = "Counting the number of solutions. {A} survey of recent inclusion results in the area of counting classes", booktitle = "Mathematical {F}oundations of {C}omputer {S}cience (MFCS'90)", series = "Lecture Notes in Comput. Sci.", volume = 452, pages = "121--134", publisher = springer, year = 1990, doi = {10.1007/BFb0029600} } @comment{added item: conference version of the article below*, found maually} @comment{multiple crossref trouble: crossref = {pstoc85}} @inproceedings{VV85conf, author = "Leslie G. Valiant and Vijay V. Vazirani", title = "{{\sf NP}} is as easy as detecting unique solutions", booktitle = stoc85, year = 1985, publisher = acm, pages = "458--463", doi = {10.1145/22145.22196} } @comment{added conference version above, doi found manually} @article{VV85, author = "Leslie G. Valiant and Vijay V. Vazirani", title = "{{\sf NP}} is as easy as detecting unique solutions", journal = tcs, volume = 47, year = 1986, number = 1, pages = "85--93", note = {Preliminary version in \href{http://dl.acm.org/citation.cfm?doid=22145.22196}{STOC'85}}, doi = {10.1016/0304-3975(86)90135-0} } @inproceedings{Wat00, author = "John Watrous", title = "Succinct quantum proofs for properties of finite groups", crossref={pfocs00}, pages = "537--546", note ={\href{http://arxiv.org/abs/cs/0009002}{arXiv:cs/0009002}}, doi = {10.1109/SFCS.2000.892141} } @Proceedings{pfocs84, booktitle = focs84, year = {1984}, publisher=ieee, } @Proceedings{pfocs00, booktitle = focs00, year = {2000}, publisher=ieee, } @Proceedings{pfocs07, booktitle = focs07, year = {2007}, publisher=ieee, } @comment{multiple pstoc85 references would result in missing booktitle/year/publisher in each reference!} @comment{@Proceedings{pstoc85,booktitle = stoc85,year = {1985},publisher=acm,}} %%%%%%%%%%%%%%%%%%%%%%%%%% %%%%% bib of v008a018 %%%%%%%%%%%%%%%%%%%%%%%%%% @comment{Many instances of "Steiner" were corrected to "{S}teiner".} @string{acm = "ACM Press"} @string{ieee = "IEEE Comp. Soc. Press"} @string{springer = "Springer"} @string{stoc91="Proc. 23rd STOC"} @string{stoc02="Proc. 34th STOC"} @string{stoc04="Proc. 36th STOC"} @string{stoc08="Proc. 40th STOC"} @string{focs98="Proc. 39th FOCS"} @string{focs01="Proc. 42nd FOCS"} @string{focs08="Proc. 49th FOCS"} @string{focs09="Proc. 50th FOCS"} @string{soda=" Ann. ACM-SIAM Symp. on Discrete Algorithms"} @string{soda99= "Proc. 10th" # soda # " (SODA'99)"} @string{soda09= "Proc. 20th" # soda # " (SODA'09)"} @string{SIAMJComput="SIAM J. Comput."} @string{tcs = "Theoret. Comput. Sci."} @string{combinatorica = "Combinatorica"} @string{ipl = "Inform. Process. Lett."} @string{JAlgorithms="J. Algorithms"} @string{JCombinTheorySerA="J. Combin. Theory Ser. A"} @string{jcss="J. Comput. System Sci."} @string{icalp=" Internat. Colloq. on Automata, Languages and Programming"} @string{icalp09= "Proc. 36th" # icalp # " (ICALP'09)"} @string{ipco= "Ann. Conf. on Integer Programming and Combinatorial Optimization"} @string{ipco01= "Proc. 8th " # ipco # " (IPCO '01)"} @string{approx=" Internat. Workshop on Approximation Algorithms for Combinatorial Optimization Problems"} @string{approx08= "Proc. 11th" # approx # " (APPROX'08)"} @article{akr95, title = {When Trees Collide: An Approximation Algorithm for the Generalized {S}teiner Problem on Networks}, author = {Ajit Agrawal and Philip Klein and R. Ravi}, note = {Preliminary version in \href{http://dx.doi.org/10.1145/103418.103437}{STOC'91}}, journal = SiamJComput, number = {3}, volume = {24}, year = {1995}, bibsource = {DBLP, http://dblp.uni-trier.de}, pages = {440-456}, doi = {10.1137/S0097539792236237}, } @comment{conference version*} @inproceedings{akr95-conference, title = {When Trees Collide: An Approximation Algorithm for the Generalized {S}teiner Problem on Networks}, author = {Ajit Agrawal and Philip N. Klein and R. Ravi}, crossref = {pstoc91}, bibsource = {DBLP, http://dblp.uni-trier.de}, pages = {134-144}, doi = {10.1145/103418.103437}, } @article{bp89, title = {The {S}teiner Problem with Edge Lengths 1 and 2}, author = {Marshall Bern and Paul Plassmann}, journal = ipl, number = {4}, volume = {32}, year = {1989}, bibsource = {DBLP, http://dblp.uni-trier.de}, pages = {171-176}, doi = {10.1016/0020-0190(89)90039-2}, } @article{cvv03, title = {An Approximation Algorithm for the Minimum-Cost $k$-Vertex Connected Subgraph}, author = {Joseph Cheriyan and Santosh Vempala and Adrian Vetta}, journal = SiamJComput, number = {4}, volume = {32}, year = {2003}, bibsource = {DBLP, http://dblp.uni-trier.de}, pages = {1050-1055}, doi = {10.1137/S0097539701392287}, note = {Preliminary version in \href{http://dx.doi.org/10.1145/509907.509955}{STOC'02}}, } @comment{conference version*} @inproceedings{cvv03-conference, author = {Joseph Cheriyan and Santosh Vempala and Adrian Vetta}, title = {Approximation algorithms for minimum-cost k-vertex connected subgraphs}, crossref = {pstoc02}, pages = {306-312}, doi = {10.1145/509907.509955}, bibsource = {DBLP, http://dblp.uni-trier.de} } @article{cvv06, title = {Network Design Via Iterative Rounding Of Setpair Relaxations}, author = {Joseph Cheriyan and Santosh Vempala and Adrian Vetta}, journal = combinatorica, number = {3}, volume = {26}, year = {2006}, bibsource = {DBLP, http://dblp.uni-trier.de}, pages = {255-275}, doi = {10.1007/s00493-006-0016-z}, } @inproceedings{cck08, title = {Network design for vertex connectivity}, author = {Tanmoy Chakraborty and Julia Chuzhoy and Sanjeev Khanna}, crossref = {pstoc08}, bibsource = {DBLP, http://dblp.uni-trier.de}, pages = {167-176}, doi = {10.1145/1374376.1374403}, } @inproceedings{ckor08, title = {Single-Sink Network Design with Vertex Connectivity Requirements}, author = {Chandra Chekuri and Nitish Korula}, booktitle = {IARCS Ann. Conf. on Foundations of Software Tech. and Theor. Comput. Sci. (FSTTCS'08)}, publisher = {Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik}, year = {2008}, bibsource = {DBLP, http://dblp.uni-trier.de}, pages = {131-142}, doi = {10.4230/LIPIcs.FSTTCS.2008.1747}, } @inproceedings{chandra08, title = {A Graph Reduction Step Preserving Element-Connectivity and Applications}, author = {Chandra Chekuri and Nitish Korula}, booktitle = icalp09, year = {2009}, publisher = springer, bibsource = {DBLP, http://dblp.uni-trier.de}, pages = {254-265}, doi = {10.1007/978-3-642-02927-1\_22}, } @inproceedings{ck08, title = {Algorithms for Single-Source Vertex Connectivity}, author = {Julia Chuzhoy and Sanjeev Khanna}, crossref = {pfocs08}, bibsource = {DBLP, http://dblp.uni-trier.de}, pages = {105-114}, doi = {10.1109/FOCS.2008.63}, } @comment{original entry from authors} @article{dr82, title = {Bounds on the Length of Disjunctive Codes}, author = {Arkadi{\u i}~G.~D'yachkov and Vyacheslav~V.~Rykov}, journal = {Probl. Peredachi Inf.}, volume = {18}, year = {1982}, issue = {3}, note = {\href{http://www.mathnet.ru/php/archive.phtml?wshow=paper&jrnid=ppi&paperid=1232&option_lang=eng}{[Math-Net.ru]}}, pages = {7-13}, } @inproceedings{fl08, title = {An {$O(\log^2 k)$}-approximation algorithm for the $k$-vertex connected spanning subgraph problem}, author = {Jittat Fakcharoenphol and Bundit Laekhanukit}, crossref = {pstoc08}, bibsource = {DBLP, http://dblp.uni-trier.de}, pages = {153-158}, doi = {10.1145/1374376.1374401}, } @inproceedings{f01, author = {Lisa Fleischer}, title = {A 2-Approximation for Minimum Cost \{0, 1, 2\} Vertex Connectivity}, booktitle = ipco01, year = {2001}, publisher = springer, pages = {115-129}, doi = {10.1007/3-540-45535-3\_10}, bibsource = {DBLP, http://dblp.uni-trier.de} } @article{fjw06, title = {Iterative rounding 2-approximation algorithms for minimum-cost vertex connectivity problems}, author = {Lisa Fleischer and Kamal Jain and David P. Williamson}, journal = jcss, number = {5}, volume = {72}, year = {2006}, bibsource = {DBLP, http://dblp.uni-trier.de}, pages = {838-867}, doi = {10.1016/j.jcss.2005.05.006}, note = {Preliminary version in \href{http://dx.doi.org/10.1109/SFCS.2001.959908}{FOCS'01}} } @comment{conference version*} @inproceedings{fjw06-conference, author = {Lisa Fleischer and Kamal Jain and David P. Williamson}, title = {An Iterative Rounding 2-Approximation Algorithm for the Element Connectivity Problem}, crossref = {pfocs01}, pages = {339-347}, ee = {10.1109/SFCS.2001.959908}, bibsource = {DBLP, http://dblp.uni-trier.de} } @article{fj95, title = {Minimal Edge-Coverings of Pairs of Sets}, author = {Andr{\'a}s Frank and Tibor Jord{\'a}n}, journal = {J. Combin. Theory Ser. B}, number = {1}, volume = {65}, year = {1995}, doi = {10.1006/jctb.1995.1044}, bibsource = {DBLP, http://dblp.uni-trier.de}, pages = {73-110}, } @article{f96, title = {On $r$-Cover-free Families}, author = {Zolt{\'a}n F{\"u}redi}, journal = JCombinTheorySerA, number = {1}, volume = {73}, year = {1996}, bibsource = {DBLP, http://dblp.uni-trier.de}, pages = {172-173}, doi = {10.1006/jcta.1996.0012}, } @article{jain98, title = {A Factor 2 Approximation Algorithm for the Generalized {S}teiner Network Problem}, author = {Kamal Jain}, journal = combinatorica, number = {1}, volume = {21}, year = {2001}, bibsource = {DBLP, http://dblp.uni-trier.de}, pages = {39-60}, doi = {10.1007/s004930170004}, note = {Preliminary version in \href{http://dx.doi.org/10.1109/SFCS.1998.743495}{FOCS'98}} } @comment{conference version*} @inproceedings{jain98-conference, author = {Kamal Jain}, title = {A Factor 2 Approximation Algorithm for the Generalized {S}teiner Network Problem}, crossref = {pfocs98}, pages = {448-457}, ee = {10.1109/SFCS.1998.743495}, bibsource = {DBLP, http://dblp.uni-trier.de} } @article{jain-element-connectivity, title = {A primal-dual schema based approximation algorithm for the element connectivity problem}, author = {Kamal Jain and Ion M\u{a}ndoiu and Vijay V. Vazirani and David P. Williamson}, note = {Preliminary version in \href{http://dl.acm.org/citation.cfm?id=314500.314869}{SODA'99}}, journal = JAlgorithms, number = {1}, volume = {45}, year = {2002}, bibsource = {DBLP, http://dblp.uni-trier.de}, pages = {1-15}, doi = {10.1016/S0196-6774(02)00222-5}, } @comment{conference version*} @inproceedings{jain-element-connectivity-conference, title = {A Primal-Dual Schema Based Approximation Algorithm for the Element Connectivity Problem}, author = {Kamal Jain and Ion I. M\u{a}ndoiu and Vijay V. Vazirani and David P. Williamson}, crossref = {psoda99}, bibsource = {DBLP, http://dblp.uni-trier.de}, pages = {484-489}, eprint = {acm:314500.314869}, } @article{kkl04, title = {Hardness of Approximation for Vertex-Connectivity Network Design Problems}, author = {Guy Kortsarz and Robert Krauthgamer and James R. Lee}, note = {Preliminary version in \href{http://dx.doi.org/10.1007/3-540-45753-4_17}{APPROX'02}}, journal = SIAMJComput, number = {3}, volume = {33}, year = {2004}, bibsource = {DBLP, http://dblp.uni-trier.de}, pages = {704-720}, doi = {10.1137/S0097539702416736}, } @comment{conference version*} @inproceedings{kkl04-conference, title = {Hardness of Approximation for Vertex-Connectivity Network-Design Problems}, author = {Guy Kortsarz and Robert Krauthgamer and James R. Lee}, booktitle = approx02, year = {2002}, publisher = springer, bibsource = {DBLP, http://dblp.uni-trier.de}, pages = {185-199}, doi = {10.1007/3-540-45753-4\_17}, } @article{kn04, title = {Approximating $k$-node Connected Subgraphs via Critical Graphs}, author = {Guy Kortsarz and Zeev Nutov}, journal = {SIAM J. Comput.}, number = {1}, volume = {35}, year = {2005}, doi = {10.1137/S0097539703435753}, bibsource = {DBLP, http://dblp.uni-trier.de}, pages = {247-257}, note = {Preliminary version in \href{http://dx.doi.org/10.1145/1007352.1007381}{STOC'04}} } @inproceedings{kn04-conference, author = {Guy Kortsarz and Zeev Nutov}, title = {Approximation algorithm for k-node connected subgraphs via critical graphs}, crossref = {pstoc04}, pages = {138-145}, doi = {10.1145/1007352.1007381}, bibsource = {DBLP, http://dblp.uni-trier.de} } @inproceedings{krs99, title = {Coding Constructions for Blacklisting Problems without Computational Assumptions}, author = {Ravi Kumar and Sridhar Rajagopalan and Amit Sahai}, booktitle = {19th Ann. Internat. Cryptology Conf. (CRYPTO'99)}, year = {1999}, publisher = springer, bibsource = {DBLP, http://dblp.uni-trier.de}, pages = {609-623}, doi = {10.1007/3-540-48405-1\_38}, } @comment{original entry from authors} @book{mr95, title = {Randomized Algorithms}, author = {Rajeev Motwani and Prabhakar Raghavan}, publisher = {Cambridge University Press}, isbn = {0-521-47465-5}, year = {1995}, bibsource = {DBLP, http://dblp.uni-trier.de}, } @comment{Note that the authors here cite APPROX-RANDOM. I decided to just cite APPROX because the paper was a "contributed talk of APPROX" according to DBLP (http://www.informatik.uni-trier.de/~ley/db/conf/approx/approx2008.html).} @comment{replaced by journal version***} @inproceedings{ln08-original, title = {Inapproximability of Survivable Networks}, author = {Yuval Lando and Zeev Nutov}, booktitle = approx08, publisher = springer, year = {2008}, bibsource = {DBLP, http://dblp.uni-trier.de}, pages = {146-152}, doi = {10.1007/978-3-540-85363-3\_12}, } @comment{journal version added*} @article{ln08, title = {Inapproximability of survivable networks}, author = {Yuval Lando and Zeev Nutov}, note = {Preliminary version in \href{http://dx.doi.org/10.1007/978-3-540-85363-3_12}{APPROX'08}}, journal = tcs, number = {21-23}, volume = {410}, year = {2009}, bibsource = {DBLP, http://dblp.uni-trier.de}, pages = {2122-2125}, doi = {10.1016/j.tcs.2009.01.036}, } @article{nutov08, title = {A note on Rooted Survivable Networks}, author = {Zeev Nutov}, journal = ipl, number = {19}, volume = {109}, year = {2009}, bibsource = {DBLP, http://dblp.uni-trier.de}, pages = {1114-1119}, doi = {10.1016/j.ipl.2009.07.011}, } @inproceedings{nutov09, title = {Approximating Minimum Cost Connectivity Problems via Uncrossable Bifamilies and Spider-Cover Decompositions}, author = {Zeev Nutov}, crossref = {pfocs09}, bibsource = {DBLP, http://dblp.uni-trier.de}, pages = {417-426}, doi = {10.1109/FOCS.2009.9}, } @inproceedings{nutov-k-connected-subgraph, author = {Zeev Nutov}, title = {An almost {$O(\log k)$}-approximation for $k$-connected subgraphs}, crossref = {psoda09}, pages = {912-921}, eprint = {acm:1496770.1496869}, bibsource = {DBLP, http://dblp.uni-trier.de} } @article{swz00, title = {Some New Bounds for Cover-Free Families}, author = {Douglas R. Stinson and Ruizhong Wei and Lie Zhu}, journal = JCombinTheorySerA, number = {1}, volume = {90}, year = {2000}, bibsource = {DBLP, http://dblp.uni-trier.de}, pages = {224-234}, doi = {10.1006/jcta.1999.3036}, } @proceedings{pstoc91, booktitle = stoc91, publisher = acm, year = {1991}, } @proceedings{pstoc02, booktitle = stoc02, publisher = acm, year = {2002}, } @proceedings{pstoc04, booktitle = stoc04, publisher = acm, year = {2004}, } @proceedings{pstoc08, booktitle = stoc08, publisher = acm, year = {2008}, } @proceedings{pfocs98, booktitle = focs98, publisher = ieee, year = {1998}, } @proceedings{pfocs01, booktitle = focs01, publisher = ieee, year = {2001}, } @proceedings{pfocs08, booktitle = focs08, publisher = ieee, year = {2008}, } @proceedings{pfocs09, booktitle = focs09, publisher = ieee, year = {2009}, } @proceedings{psoda99, booktitle = soda99, publisher = acm, year = {1999}, } @proceedings{psoda09, booktitle = soda09, publisher = acm, year = {2009}, } %%%%%%%%%%%%%%%%%%%%%%%%%% %%%%% bib of v008a019 %%%%%%%%%%%%%%%%%%%%%%%%%% @string{ieee = "IEEE Comp. Soc. Press"} @string{acm = "ACM Press"} @string{springer = "Springer"} @string{JACM="J. ACM"} @string{SIAMJDiscreteMath="SIAM J. Discrete Math."} @string{paml="IEEE Trans. Pattern Anal. Mach. Intell."} @article{papandreou, title = {Multigrid Geometric Active Contour Models}, author = {George Papandreou and Petros Maragos}, journal = {IEEE Trans. Image Processing}, number = {1}, volume = {16}, year = {2007}, bibsource = {DBLP, http://dblp.uni-trier.de}, pages = {229-240}, doi = {10.1109/TIP.2006.884952}, } @comment{conference version*} @inproceedings{papandreou-conference, author = {George Papandreou and Petros Maragos}, title = {A Fast Multigrid Implicit Algorithm for the Evolution of Geodesic Active Contours}, booktitle = {2004 IEEE Comp. Soc. Conf. on Computer Vision and Pattern Recognition (CVPR'04)}, publisher = ieee, year = {2004}, pages = {689-694}, doi = {10.1109/CVPR.2004.11}, bibsource = {DBLP, http://dblp.uni-trier.de} } @inproceedings{shotton, title = {Contour-Based Learning for Object Detection}, author = {Jamie Shotton and Andrew Blake and Roberto Cipolla}, booktitle = {10th IEEE Internat. Conf. on Computer Vision (ICCV'05)}, publisher = ieee, year = {2005}, bibsource = {DBLP, http://dblp.uni-trier.de}, pages = {503-510}, doi = {10.1109/ICCV.2005.63}, } @inproceedings{ratliff, title = {{CHOMP}: Gradient optimization techniques for efficient motion planning}, author = {Nathan Ratliff and Matt Zucker and J. Andrew Bagnell and Siddhartha Srinivasa}, booktitle = { 2009 IEEE Internat. Conf. on Robotics and Automation (ICRA'09)}, publisher = ieee, year = {2009}, bibsource = {DBLP, http://dblp.uni-trier.de}, pages = {489-494}, doi = {10.1109/ROBOT.2009.5152817}, } @inproceedings{hage