Gasarch, William Ian - Institute for Advanced Computer Studies & Department of Computer Science, University of Maryland at College Park

• On the Relative Sizes of Learnable Sets
• The Book Review Column1 by William Gasarch
• Public Key Encryption that Allows PIR Queries Eyal Kushilevitz
• The Book Review Column 1 by William Gasarch
• The Book Review Column 1 by William Gasarch
• Derandomization: A Brief Overview Valentine Kabanets \Lambda
• The Book Review Column 1 by William Gasarch
• Rectangle Free Coloring of Grids Stephen Fenner
• THE ERDOS DISTANCE PROBLEM: LECTURE NOTES JULIA GARIBALDI AND ALEX IOSEVICH
• The Book Review Column1 by William Gasarch
• The Book Review Column1 by William Gasarch
• Upper Bounds on the Large Ramsey Number LR2(k) Exposition by William Gasarch (gasarch@cs.umd.edu)
• SIGACT News Complexity Theory Column 36 Lane A. Hemaspaandra
• ber die Kongruenz axe + bye + cze ... 0 (mod. p). Hurwitz, A.
• Mmoire sur la thorie des nombres. in: Journal fr die reine und angewandte
• For any n points in the plane: (a) There are n0.66
• A Practical Scheme for Non-interactive Verifiable Secret Sharing Paul Feldman
• SATIRES OF BOB DYLAN RANKED Here I RANK the satires of Bob Dylan. The criteria is a combination of humor, how much it
• The Book Review Column 1 by William Gasarch
• SUMPRODUCT Theorems An Exposition by William Gasarch
• The Book Review Column 1 by William Gasarch
• The Book Review Column 1 by William Gasarch
• From Tedalvy@aol.com Thu Jun 20 06:10:52 2002 Subject: Satires of Bob Dylan songs To: gasarch@cs.umd.edu bill: this seems to be missing from your list. peace, ted alvy
• The Book Review Column 1 by William Gasarch
• The Book Review Column 1 by William Gasarch
• The Book Review Column 1 by William Gasarch
• The Book Review Column1 by William Gasarch
• Hardness vs. Randomness Noam Nisan 1
• A Random Server Model for Private Information Retrieval Information Theoretic PIR Avoiding Database Replication \Lambda
• An introduction to Kolmogorov Complexity and its Applications Second Edition, 1997
• The Book Review Column 1 by William Gasarch
• INTEGER SETS CONTAINING NO ARITHMETIC PROGRESSIONS
• The Book Review Column1 by William Gasarch
• The Book Review Column 1 by William Gasarch
• The Book Review Column 1 by William Gasarch
• The Book Review Column1 by William Gasarch
• 122 R. RADQ [Dec. 15, NOTE ON COMBINATORIAL ANALYSIS
• Rectangle Free Coloring of Grids Stephen Fenner
• Addition in log2 n + O(1) Steps on Average: A Simple Analysis Richard Beigel
• A tPrivate kDatabase Private Information Retrieval Scheme
• The Book Review Column 1 by William Gasarch
• An Oblivious Transfer Protocol with LogSquared Communication
• Symmetrically Private Information Retrieval (Extended Abstract)
• The Book Review Column1 by William Gasarch
• This is a book IN PROGRESS. If you have any questions, com-ments, complaints, funny stories about van der Waerden, please
• Finding Large 3-free Sets I: The Small n Case William Gasarch a
• Verifiable Secret Sh~lring and Acllieving Silnllll~llleity in the Presence of Falllts
• Information-Theoretic Private Information Retrieval: A Unified Construction
• The Book Review Column1 by William Gasarch
• Van Der Waerden's Theorem: Exposition and Generalizations By William Gasarch
• On Finding the Number of Graph Automorphisms
• THE DISTRIBUTION OF QUADRATIC RESIDUES AND NON-RESIDUES
• The Book Review Column 1 by William Gasarch
• The Book Review Column 1 by William Gasarch
• The Book Review Column 1 by William Gasarch
• The Book Review Column 1 by William Gasarch
• The Canonical Van Der Waerden's Theorem: An Exposition By William Gasarch
• A Nearly Tight Lower Bound for Private Information Retrieval Richard Beigel
• The Book Review Column1 by William Gasarch
• The Book Review Column1 by William Gasarch
• The Book Review Column1 by William Gasarch and Samir Khuller
• Automata Techniques for Query Inference William Gasarch
• The Book Review Column1 by William Gasarch
• Trivial hard-core predicates. Some functions have "trivial" hard-core predicates. For example, let f be the function that simply drops the last
• Christmas is Pain-Zimmerman, From: Comic Sutra Turkey a gobblin' out in the yard
• New Locally Decodable Codes and Private Information Retrieval Schemes Sergey Yekhanin
• The Book Review Column 1 by William Gasarch
• This seems to be a commercial in New Zealend urging people to buy Color TVs. It is also a 45-record with the following on its cover
• The Book Review Column 1 by William Gasarch
• On the Finiteness of the Recursive Chromatic Number William I Gasarch
• Sane Bounds on Van der Waerden-Type Numbers Nils Molina Anand Oza Rohan Puttagunta
• Breaking the O(n 1/(2k-1) ) Barrier for InformationTheoretic Private Information Retrieval #
• The Book Review Column 1 by William Gasarch
• The Book Review Column 1 by William Gasarch
• The Book Review Column 1 by William Gasarch and Samir Khuller
• Induced Graph Ramsey Theory Marcus Schaefer
• List decoding: algorithms and applications \Lambda Madhu Sudan y
• The Book Review Column 1 by William Gasarch
• Rectangle Free Coloring of Grids Stephen Fenner-U of SC William Gasarch-U of MD
• Celebrities Known by One Name (List by William Gasarch with help from ***EVAN*** and ***SORELLE***
• The Multiparty Communication Complexity of Exact-T: Improved Bounds and New Problems
• Lower bounds on the Deterministic and Quantum Communication Complexity of HAM(a)
• Constant Time Parallel Sorting: An Empirical View William Gasarch
• Some Connections between Bounded Query Classes and Non-Uniform Complexity
• A SURVEY ON PRIVATE INFORMATION RETRIEVAL William Gasarch
• GEMS IN THE FIELD OF BOUNDED QUERIES William Gasarch
• Max and Min Limiters James Owings
• A Survey of Constant Time Parallel Sorting (Preliminary Version)
• 258 Handbook of Discrete and Combinatorial Mathematics 16.3 COMPUTABILITY
• Binary Search and Recursive Graph Problems William I. Gasarch 1
• Training Sequences Dana Angluin
• The Book Review Column1 by William Gasarch
• The Book Review Column1 by William Gasarch
• The Book Review Column1 by William Gasarch
• The Book Review Column1 by William Gasarch
• The Book Review Column1 by William Gasarch
• The Book Review Column1 by William Gasarch
• The Book Review Column1 by William Gasarch
• The Book Review Column1 by William Gasarch
• The Book Review Column1 by William Gasarch
• The Book Review Column1 by William Gasarch
• The Book Review Column1 by William Gasarch
• The Book Review Column1 by William Gasarch
• The Book Review Column1 by William Gasarch
• The Book Review Column1 by William Gasarch
• The Book Review Column1 by William Gasarch
• The Book Review Column1 by William Gasarch
• The Book Review Column1 by William Gasarch
• The Book Review Column1 by William Gasarch
• The Book Review Column1 by William Gasarch
• The Book Review Column1 by William Gasarch
• The Book Review Column1 by William Gasarch
• e urvey on rivte snformtion etrievl niversity of wrylnd t gollege rk
• A Geometric Approach to Information-Theoretic Private Information Retrieval
• ) Lower Bound for Bilinear Group Based Private Information Retrieval
• New Locally Decodable Codes and Private Information Retrieval Schemes Sergey Yekhanin
• A New and Efficient All-Or-Nothing Disclosure of Secrets Protocol
• Secure Games with Polynomial Expressions Aggelos Kiayias1
• On Runs of Residues Author(s): D. H. Lehmer and Emma Lehmer
• Machine Proof of a Theorem on Cubic Residues Author(s): D. H. Lehmer, E. Lehmer, W. H. Mills, J. L. Selfridge
• Bounds for Pairs of Consecutive Seventh and Higher Power Residues Author(s): John Brillhart, D. H. Lehmer, Emma Lehmer
• On Quadruples of Consecutive kth Power Residues Author(s): R. L. Graham
• Bounds for Pairs of Cubic Residues Author(s): M. Dunton
• On Applications of Van Der Waerden's Theorem Author(s): John R. Rabung and Van Der Waerden
• On the Distribution of Quadratic Residues and Nonresidues Modulo a Prime Number Author(s): Ren Peralta
• COMBINATORIAL PROOFS OF THE POLYNOMIAL VAN DER WAERDEN THEOREM AND
• An Application of Lovikz' Local Lemma-A New Lower Bound for the
• Advances in Applied Mathematics 44 (2010) 243247 Contents lists available at ScienceDirect
• Studien zur Kombinatorik in: Mathematische Zeitschrift | Mathematische Zeitschrift | Article
• AN ERGODIC SZEMEREDI THEOREM FOR COMMUTING TRANSFORMATIONS
• JOURNAL OF COMBINATORIAL THEORY, Series A 34, 331-339 (1983) A Canonical Partition Theorem for
• Canad. Math. Bull. Vol. 40 (2), 1997 pp. 149157 MONOCHROMATIC HOMOTHETIC COPIES
• Journal of Combinatorial Theory, Series A 86, 214 231 (1999) An Infinitary Polynomial van der Waerden Theorem
• ON SETS OF NATURAL NUMBERS WHOSE DIFFERENCE SET CONTAINS NO SQUARES
• Notes on Szemeredi's Regularity Lemma Ernie Croot
• GAFA, Geom. funct. anal. Vol. 8 (1998) 529 551
• GAFA, Geom. funct. anal. Vol. 11 (2001) 465 588
• Better Bounds on Rado Numbers Russell Moriarty
• Square-Difference-Free Sets of Size (n0.7334 Richard Beigel
• Verifiable Secret Sharing and Multiparty Protocols with Honest Majority
• J, Cryptoiogy (1996) 9:191-195 Joumol of O 1996International Association for
• On the Different Distances Determined by n Points Author(s): Leo Moser
• Distinct Distances in Three and Higher Dimensions Boris Aronov
• Distinct Distances in Three and Higher Dimensions Boris Aronov
• Constructing Ramsey Graphs from Boolean Function Representations Parikshit Gopalan
• Induced Graph Ramsey Theory Marcus Schaefer
• If L is ANY set then SUBSEQ(L) is Regular Exposition by William Gasarch (gasarch@cs.umd.edu)
• TANGLED UP IN SEUSS From Salon
• Aeta Math. Hung. 56 (1---2)(1990),155--158.
• The Complexity of Learning SUBSEQ(A) Stephen Fenner1
• An# n 1/3 ) Lower Bound for Bilinear Group Based Private Information Retrieval
• The Book Review Column 1 by William Gasarch
• On Bounded Queries and Approximation Richard Chang
• Acta Mathematica Academiae Scientiarum Hungaricae Tomus 3i (3--4), (1978), pp. 355--386.
• Brief introduction to unprovability Andrey Bovykin
• JOURNAL OF COMBINATORIAL THEORY, Series A 36, 342-354 (1984) The Number of Different Distances Determined
• The Book Review Column1 by William Gasarch
• Constructing Ramsey Graphs from Boolean Function Representations Parikshit Gopalan
• The Book Review Column 1 by William Gasarch
• One-way functions and pseudo-random generators
• PAIRS OF CONSECUTIVE POWER RESIDUES D. H. LEHMER, EMMA LEHMER, AND W. H. MILLS
• Private Information Retrieval Based on the Subgroup Membership Problem
• The Book Review Column 1 by William Gasarch
• The Book Review Column 1 by William Gasarch
• arXiv:quantph/0403140 Improved Lower Bounds for Locally Decodable Codes
• Exponential Lower Bound for 2-Query Locally Decodable Codes via a Quantum Argument
• The Book Review Column 1 by William Gasarch
• DIMACS Technical Report 200103 January 2001
• A Survey on Private Information Retrieval William Gasarch
• On Sets of Distances of n Points Author(s): P. Erdos
• The Book Review Column 1 by William Gasarch
• Protecting Data Privacy in Private Information Retrieval Yael Gertner y Yuval Ishai z Eyal Kushilevitz x Tal Malkin {
• Computational Complexity: A Quantitative Perspective
• On Yao's XORLemma \Lambda Oded Goldreich y Noam Nisan z Avi Wigderson x
• It follows that m k = n 1 k+3 (s(n) + 1) \Gamma3
• TWO COMBINATORIAL THEOREMS ON ARITHMETIC PROGRESSIONS
• The Weak Prime Number Theorem 1 Introduction
• The Book Review Column1 by William Gasarch
• The Bulletin of Symbolic Logic Volume 11, Number 3, Sept. 2005
• BPP HAS SUBEXPONENTIAL TIME SIMULATIONS
• Upper bound on the communication complexity of private information
• The Book Review Column 1 by William Gasarch
• On the Bound for a Pair of Consecutive Quartic Residues of a Prime Author(s): R. G. Bierstedt and W. H. Mills
• The Book Review Column1 by William Gasarch
• The Book Review Column 1 by William Gasarch
• [1] A. Ambainis, ``An upper bound for Private Information Retrieval'', In Proc. of 24 th ICALP,1997, 401407.
• Replication Is Not Needed: Single Database, ComputationallyPrivate Information Retrieval
• The Book Review Column1 by William Gasarch
• When Can One Load a Set of Dice so that the Sum is Uniformly Distributed?
• Inferring Answers to Queries William I. Gasarch a,,1
• The Book Review Column 1 by William Gasarch
• The Book Review Column 1 by William Gasarch
• The Book Review Column 1 by William Gasarch
• TANGLED UP IN SEUSS From Salon
• General Linear Secret Sharing (Extended Abstract)
• The Book Review Column 1 by William Gasarch
• Superpolynomial Size Set-Systems with Restricted Intersections mod 6 and Explicit Ramsey Graphs
• The Book Review Column 1 by William Gasarch
• The Book Review Column1 by William Gasarch
• Private Access to Distributed Information
• LIKE A SUBURBAN DRONE by THE CAPITOL STEPS From Thank God I'm a Contra Boy
• The Book Review Column 1 by William Gasarch
• Optimal Lower Bounds for 2Query Locally Decodable Linear Codes
• The Book Review Column 1 by William Gasarch
• Efficient Pseudorandom Generators from Exponentially Hard One-Way Functions
• 2-Source Dispersers for Sub-Polynomial Entropy and Ramsey Graphs Beating the Frankl-Wilson Construction
• An Exposition of the Main Theorem in Enumerations of the Kolmogorov Function
• Independent arithmetic progressions in clique-free graphs on the natural numbers
• An introduction to Kolmogorov Complexity and its Applications Second Edition, 1997
• An Oblivious Transfer Protocol with Log-Squared Communication
• arXiv:0706.4112v3 Induced Ramsey-type theorems
• Single Database Private Information Retrieval Implies Oblivious Transfer
• The Book Review Column 1 by William Gasarch
• The second part of the next claim follows from a standard application of Chernoff Claim 2. The above testing procedure satisfies the following
• The Book Review Column 1 by William Gasarch
• A TIGHT LOWER BOUND FOR RESTRICTED PIR PROTOCOLS
• When Does a Random Robin Hood Win? William Gasarch
• The Book Review Column1 by William Gasarch
• Lower Bounds for Linear Locally Decodable Codes and Private Information Retrieval
• Polynomial With Minimal Deviance (This work was done by Chebyshev in the 1800's.)
• Lower limit for the number of sets of solutions of xe + ye + ze ... 0 (mod p).
• The Book Review Column1 by William Gasarch
• Extremes in the Degrees of Inferability Lance Fortnow
• A Problem in Combinatorics that is Independent of ZFC
• The Book Review Column1 by William Gasarch
• Pseudorandom Generators from One-Way Functions
• General Constructions for InformationTheoretic Private Information Retrieval \Lambda
• The Book Review Column 1 by William Gasarch
• Reconstructing Curves in Three (and Higher) Dimensional Space from Noisy Data
• P=BPP unless E has subexponential circuits: Derandomizing the XOR Lemma
• The Book Review Column 1 by William Gasarch
• The Book Review Column1 by William Gasarch
• The Book Review Column1 by William Gasarch
• The Book Review Column1 by William Gasarch
• Acadmie des sciences (France). Comptes rendus hebdomadaires des sances de l'Acadmie des sciences. 1880. 1/ Les contenus accessibles sur le site Gallica sont pour la plupart des reproductions numriques d'oeuvres tombes dans le domaine public provenant des
• The Book Review Column1 by William Gasarch
• The Communication Complexity of Enumeration, Elimination, and Selection
• Aha! An Illuminating Perspective David Ginat (moderator) Dan Garcia William Gasarch
• A Survey of Recursive Combinatorics William Gasarch
• Pseudo-Random Generators for All Hardnesses Christopher Umans
• Single-Database Private Information Retrieval with Constant Communication Rate
• Notation 0.1 The expression X(n) negl(n) means that, for polynomial p, for large n, X(n) 1
• [10] R. Cramer, I. Damgard, and U. Maurer. Span pro grams and secure general multiparty computation.
• Derandomizing Complexity Classes (DRAFT) 1 Peter Bro Miltersen
• Decoding of Interleaved Reed Solomon Codes over Noisy Data
• Consecutive Power Residues or Nonresidues Author(s): J. R. Rabung and J. H. Jordan
• Sane Bounds on Some Polynomial van der Waerden Numbers by William Gasarch1
• SETS WHOSE DIFFERENCE SET IS SQUARE-FREE Abstract. The purpose of this note is to give an exposition of the best-known bound
• Primitive Recursive Bounds for Van Der Waerden Numbers Author(s): Saharon Shelah
• Squares in a square: An On-line question Andris Ambainis1
• PRIMALITY IS IN P 1 Introduction
• Tug of War Game William Gasarch and Nick Sovich and Paul Zimand
• A Use of Ramsey Theory in Comm. Comp. This is from An Application of Hindman's Theorem to a Problem in Commmuni-
• Purely Combinatorial Proofs of Van Der Waerden-Type Theorems
• Acta Mathematica.4cademiaeScientiarumHungaricae Tomus20 (1--2), (1969), pp. 89--104.
• C. R. Acad. Sci. Paris, Ser. I 345 (2007) 183186 http://france.elsevier.com/direct/CRASS1/
• Roth's Theorem: If A [n] is large then it has a 3-AP Szemeredi's Proof
• Protest Song-Neil Innes, Tune: Generic Dylan. FromMONTY PYTHON: LIVE AT CITY CENTER (CD 1997) Also from DEAD PARROT'S SOCIETY (1994 but out of print)
• INDUCED RAMSEY NUMBERS Y. KOHAYAKAWA, H. J. PR 
• Ally McBeal-Davinci's Notebook (YES, this is the name of the group) From:Life & Times of Mike Fanning (2000)
• The Book Review Column 1 by William Gasarch
• Simplified derandomization of BPP using a hitting set generator \Lambda Oded Goldreich y Salil Vadhan z Avi Wigderson x
• On Checking Versus Evaluation of Multiple Queries William I. Gasarch
• FOURIER ANALYSIS AND GEOMETRIC COMBINATORICS
• journal of combinatorial theory, Series A 77, 222 227 (1997) Arithmetic Progressions in Sequences with
• The Book Review Column 1 by William Gasarch
• The Book Review Column 1 by William Gasarch
• Combinatorics, Probability and Computing 1993 11, 1 10 Copyright c 1993 Cambridge University Press
• Implementing WS1S via Finite Automata James Glenn
• The Book Review Column1 by William Gasarch
• SUM-PRODUCT Theorems An Exposition by William Gasarch
• Round-Optimal and Efficient Verifiable Secret Sharing
• The Book Review Column 1 by William Gasarch
• The Book Review Column 1 by William Gasarch
• BOOKS I NEED REVIEWED FOR SIGACT NEWS COLUMN Algorithms and Related Topics
• Monochromatic Equilateral Right Triangles on the Integer Grid
• Ergodic Proofs of VDW Theorem 1 Introduction
• ROTH'S THEOREM ON ARITHMETIC PROGRESSIONS Alex Iosevich
• Fundamenta Informaticae 30 (1997) 2341 1 Asking Questions versus Verifiability
• A Techniques-Oriented Survey of Bounded William Gasarch
• The Book Review Column1 by William Gasarch
• The Book Review Column 1 by William Gasarch
• REVERSE MATHEMATICS AND RECURSIVE GRAPH THEORY
• The Book Review Column1 by William Gasarch
• Periodica Mathematica Hungarica Vol. 15 (3), (1984), pp. 205--209 DIFFERENCE SETS WITHOUT SQUARES
• The Book Review Column1 by William Gasarch
• The Complexity of ODDA Richard Beigel
• The Book Review Column1 by William Gasarch
• The Book Review Column1 by William Gasarch
• SIGACT News Complexity Theory Column 71 Lane A. Hemaspaandra
• The Book Review Column1 by William Gasarch
• Limits on the Computational Power of Random Strings Eric Allendera
• Richard Beigel and Jun Tarui Abstract. We show that every language L in the class ACC can
• A Statement in Combinatorics that is Independent of ZFC
• The Book Review Column1 by William Gasarch
• SIGACT News Complexity Theory Column 71 Lane A. Hemaspaandra
• The Book Review Column1 by William Gasarch
• The Book Review Column1 by William Gasarch