@article{https://resolver.caltech.edu/CaltechAUTHORS:20201217-133744650,
title = "Convergence of incentive-driven dynamics in Fisher markets",
journal = "Games and Economic Behavior",
year = "2022",
url = "https://resolver.caltech.edu/CaltechAUTHORS:20201217-133744650",
id = "record",
issn = "0899-8256",
doi = "10.1016/j.geb.2020.11.005",
volume = "134"
}
@article{https://resolver.caltech.edu/CaltechAUTHORS:20220204-680165000,
title = "A refined approximation for Euclidean k-means",
journal = "Information Processing Letters",
year = "2022",
url = "https://resolver.caltech.edu/CaltechAUTHORS:20220204-680165000",
id = "record",
issn = "0020-0190",
doi = "10.1016/j.ipl.2022.106251",
volume = "176"
}
@article{https://resolver.caltech.edu/CaltechAUTHORS:20220210-721777000,
title = "Hadamard Extensions and the Identification of Mixtures of Product Distributions",
journal = "IEEE Transactions on Information Theory",
year = "2022",
url = "https://resolver.caltech.edu/CaltechAUTHORS:20220210-721777000",
id = "record",
issn = "0018-9448",
doi = "10.1109/tit.2022.3146630",
volume = "68"
}
@article{https://resolver.caltech.edu/CaltechAUTHORS:20210128-142707495,
title = "The invisible hand of Laplace: The role of market structure in price convergence and oscillation",
journal = "Journal of Mathematical Economics",
year = "2021",
url = "https://resolver.caltech.edu/CaltechAUTHORS:20210128-142707495",
id = "record",
issn = "0304-4068",
doi = "10.1016/j.jmateco.2021.102475",
volume = "95"
}
@inbook{https://resolver.caltech.edu/CaltechAUTHORS:20200828-114509192,
title = "Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms",
chapter = "Edge Expansion and Spectral Gap of Nonnegative Matrices",
year = "2020",
url = "https://resolver.caltech.edu/CaltechAUTHORS:20200828-114509192",
id = "record",
isbn = "978-1-61197-599-4",
doi = "10.1137/1.9781611975994.73"
}
@article{https://resolver.caltech.edu/CaltechAUTHORS:20180622-082816994,
title = "Achieving target equilibria in network routing games without knowing the latency functions",
journal = "Games and Economic Behavior",
year = "2019",
url = "https://resolver.caltech.edu/CaltechAUTHORS:20180622-082816994",
id = "record",
issn = "0899-8256",
doi = "10.1016/j.geb.2018.02.009",
volume = "118"
}
@article{https://resolver.caltech.edu/CaltechAUTHORS:20191010-093119072,
title = "Online Codes for Analog Signals",
journal = "IEEE Transactions on Information Theory",
year = "2019",
url = "https://resolver.caltech.edu/CaltechAUTHORS:20191010-093119072",
id = "record",
issn = "0018-9448",
doi = "10.1109/TIT.2019.2919632",
volume = "65"
}
@article{https://resolver.caltech.edu/CaltechAUTHORS:20190328-112416478,
title = "The duality gap for two-team zero-sum games",
journal = "Games and Economic Behavior",
year = "2019",
url = "https://resolver.caltech.edu/CaltechAUTHORS:20190328-112416478",
id = "record",
issn = "0899-8256",
doi = "10.1016/j.geb.2019.03.011",
volume = "115"
}
@article{https://resolver.caltech.edu/CaltechAUTHORS:20190103-132542769,
title = "Quasi-random multilinear polynomials",
journal = "Israel Journal of Mathematics",
year = "2019",
url = "https://resolver.caltech.edu/CaltechAUTHORS:20190103-132542769",
id = "record",
issn = "0021-2172",
doi = "10.1007/s11856-018-1821-y",
volume = "230"
}
@inbook{https://resolver.caltech.edu/CaltechAUTHORS:20180823-141633075,
title = "Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing",
chapter = "Explicit binary tree codes with polylogarithmic size alphabet",
year = "2018",
url = "https://resolver.caltech.edu/CaltechAUTHORS:20180823-141633075",
id = "record",
isbn = "978-1-4503-5559-9",
doi = "10.1145/3188745.3188928"
}
@inbook{https://resolver.caltech.edu/CaltechAUTHORS:20180410-145958889,
title = "Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms",
chapter = "Quasi-regular sequences and optimal schedules for security games",
year = "2018",
url = "https://resolver.caltech.edu/CaltechAUTHORS:20180410-145958889",
id = "record",
isbn = "978-1-6119-7503-1",
doi = "10.1137/1.9781611975031.106"
}
@article{https://resolver.caltech.edu/CaltechAUTHORS:20170614-151934720,
title = "Analysis of a Classical Matrix Preconditioning Algorithm",
journal = "Journal of the ACM",
year = "2017",
url = "https://resolver.caltech.edu/CaltechAUTHORS:20170614-151934720",
id = "record",
issn = "0004-5411",
doi = "10.1145/2988227",
volume = "64"
}
@inbook{https://resolver.caltech.edu/CaltechAUTHORS:20190402-143205523,
title = "8th Innovations in Theoretical Computer Science Conference",
chapter = "The duality gap for two-team zero-sum games",
year = "2017",
url = "https://resolver.caltech.edu/CaltechAUTHORS:20190402-143205523",
id = "record",
isbn = "978-3-95977-029-3",
doi = "10.4230/LIPIcs.ITCS.2017.56"
}
@inbook{https://resolver.caltech.edu/CaltechAUTHORS:20170214-145943460,
title = "Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms",
chapter = "Convergence of Incentive-Driven Dynamics in Fisher Markets",
year = "2017",
url = "https://resolver.caltech.edu/CaltechAUTHORS:20170214-145943460",
id = "record",
isbn = "978-1-61197-478-2",
doi = "10.1137/1.9781611974782.35"
}
@inbook{https://resolver.caltech.edu/CaltechAUTHORS:20170127-140321585,
title = "IEEE 57th Annual Symposium on Foundations of Computer Science (FOCS)",
chapter = "Extractors for Near Logarithmic Min-Entropy",
year = "2016",
url = "https://resolver.caltech.edu/CaltechAUTHORS:20170127-140321585",
id = "record",
isbn = "978-1-5090-3933-3",
doi = "10.1109/FOCS.2016.27"
}
@inbook{https://resolver.caltech.edu/CaltechAUTHORS:20160628-152001110,
chapter = "Stability of Causal Inference",
year = "2016",
url = "https://resolver.caltech.edu/CaltechAUTHORS:20160628-152001110",
id = "record"
}
@inbook{https://resolver.caltech.edu/CaltechAUTHORS:20160316-071949447,
title = "Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms",
chapter = "The adversarial noise threshold for distributed protocols",
year = "2016",
url = "https://resolver.caltech.edu/CaltechAUTHORS:20160316-071949447",
id = "record",
isbn = "978-1-611974-33-1",
doi = "10.48550/arXiv.1412.8097"
}
@inbook{https://resolver.caltech.edu/CaltechAUTHORS:20160804-113612809,
title = "IEEE 56th Annual Symposium on Foundations of Computer Science",
chapter = "Symbolic Integration and the Complexity of Computing Averages",
year = "2015",
url = "https://resolver.caltech.edu/CaltechAUTHORS:20160804-113612809",
id = "record",
isbn = "978-1-4673-8191-8",
doi = "10.1109/FOCS.2015.79"
}
@inbook{https://resolver.caltech.edu/CaltechAUTHORS:20150715-085040447,
title = "Proceedings of the Forty-Seventh Annual ACM on Symposium on Theory of Computing",
chapter = "Analysis of a Classical Matrix Preconditioning Algorithm",
year = "2015",
url = "https://resolver.caltech.edu/CaltechAUTHORS:20150715-085040447",
id = "record",
isbn = "978-1-4503-3536-2",
doi = "10.1145/2746539.2746556"
}
@inbook{https://resolver.caltech.edu/CaltechAUTHORS:20150715-085732981,
title = "Proceedings of the Forty-Seventh Annual ACM on Symposium on Theory of Computing",
chapter = "Learning Arbitrary Statistical Mixtures of Discrete Distributions",
year = "2015",
url = "https://resolver.caltech.edu/CaltechAUTHORS:20150715-085732981",
id = "record",
isbn = "978-1-4503-3536-2",
doi = "10.1145/2746539.2746584"
}
@inbook{https://resolver.caltech.edu/CaltechAUTHORS:20160105-073143688,
title = "IEEE 55th Annual Symposium on Foundations of Computer Science",
chapter = "Achieving Target Equilibria in Network Routing Games without Knowing the Latency Functions",
year = "2014",
url = "https://resolver.caltech.edu/CaltechAUTHORS:20160105-073143688",
id = "record",
isbn = "978-1-4799-6517-5",
doi = "10.1109/FOCS.2014.12"
}
@article{https://resolver.caltech.edu/CaltechAUTHORS:20141015-160530977,
title = "Volume in General Metric Spaces",
journal = "Discrete and Computational Geometry",
year = "2014",
url = "https://resolver.caltech.edu/CaltechAUTHORS:20141015-160530977",
id = "record",
issn = "0179-5376",
doi = "10.1007/s00454-014-9615-4",
volume = "52"
}
@article{https://resolver.caltech.edu/CaltechAUTHORS:20130122-104220997,
title = "Dimension-free L\_2 maximal inequality for spherical means in the hypercube",
journal = "Theory of Computing",
year = "2014",
url = "https://resolver.caltech.edu/CaltechAUTHORS:20130122-104220997",
id = "record",
issn = "1557-2862",
doi = "10.4086/toc.2014.v010a003",
volume = "10"
}
@article{https://resolver.caltech.edu/CaltechAUTHORS:20150202-090030427,
title = "Optimal Coding for Streaming Authentication and Interactive Communication",
journal = "IEEE Transactions on Information Theory",
year = "2014",
url = "https://resolver.caltech.edu/CaltechAUTHORS:20150202-090030427",
id = "record",
issn = "0018-9448",
doi = "10.1109/TIT.2014.2367094",
volume = "61"
}
@inbook{https://resolver.caltech.edu/CaltechAUTHORS:20161212-165501273,
title = "ITCS '14 Proceedings of the 5th conference on Innovations in theoretical computer science",
chapter = "Learning mixtures of arbitrary distributions over large discrete domains",
year = "2014",
url = "https://resolver.caltech.edu/CaltechAUTHORS:20161212-165501273",
id = "record",
isbn = "978-1-4503-2698-8",
doi = "10.1145/2554797.2554818"
}
@inbook{https://resolver.caltech.edu/CaltechAUTHORS:20140331-152623727,
title = "Proceedings of the 5th conference on Innovations in theoretical computer science",
chapter = "Tree Codes and a Conjecture on Exponential Sums",
year = "2014",
url = "https://resolver.caltech.edu/CaltechAUTHORS:20140331-152623727",
id = "record",
isbn = "978-1-4503-2698-8",
doi = "10.1145/2554797.2554813"
}
@inbook{https://resolver.caltech.edu/CaltechAUTHORS:20150223-101614687,
title = "Integer Programming and Combinatorial Optimization",
chapter = "Network Improvement for Equilibrium Routing",
year = "2014",
url = "https://resolver.caltech.edu/CaltechAUTHORS:20150223-101614687",
id = "record",
isbn = "978-3-319-07556-3"
}
@inbook{https://resolver.caltech.edu/CaltechAUTHORS:20170427-165048383,
title = "Advances in Cryptology – CRYPTO 2013",
chapter = "Optimal Coding for Streaming Authentication and Interactive Communication",
year = "2013",
url = "https://resolver.caltech.edu/CaltechAUTHORS:20170427-165048383",
id = "record",
isbn = "978-3-642-40083-4",
doi = "10.1007/978-3-642-40084-1\_15"
}
@article{https://resolver.caltech.edu/CaltechAUTHORS:20170427-170911967,
title = "Optimal Coding for Streaming Authentication and Interactive Communication",
journal = "Electronic Colloquium on Computational Complexity",
year = "2013",
url = "https://resolver.caltech.edu/CaltechAUTHORS:20170427-170911967",
id = "record",
issn = "1433-8092"
}
@other{https://resolver.caltech.edu/CaltechAUTHORS:20140130-133600557,
title = "An MQ/Code Cyptosystem Proposal",
year = "2013",
url = "https://resolver.caltech.edu/CaltechAUTHORS:20140130-133600557",
id = "record"
}
@inbook{https://resolver.caltech.edu/CaltechAUTHORS:20161121-172931655,
title = "Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms",
chapter = "Clustering affine subspaces: hardness and algorithms",
year = "2013",
url = "https://resolver.caltech.edu/CaltechAUTHORS:20161121-172931655",
id = "record",
isbn = "978-1-61197-251-1",
doi = "10.1137/1.9781611973105.58"
}
@article{https://resolver.caltech.edu/CaltechAUTHORS:20130125-143155195,
title = "The Effectiveness of Lloyd-Type Methods for the k-Means Problem",
journal = "Journal of the ACM",
year = "2012",
url = "https://resolver.caltech.edu/CaltechAUTHORS:20130125-143155195",
id = "record",
isbn = "0-7695-2720-5",
issn = "0004-5411",
doi = "10.1145/2395116.2395117",
volume = "59"
}
@other{https://resolver.caltech.edu/CaltechAUTHORS:20120713-075312396,
title = "Cryptography from tensor problems",
year = "2012",
url = "https://resolver.caltech.edu/CaltechAUTHORS:20120713-075312396",
id = "record"
}
@inbook{https://resolver.caltech.edu/CaltechAUTHORS:20120524-112316051,
title = "Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms",
chapter = "Data reduction for weighted and outlier-resistant clustering",
year = "2012",
url = "https://resolver.caltech.edu/CaltechAUTHORS:20120524-112316051",
id = "record",
isbn = "9781611972108"
}
@article{https://resolver.caltech.edu/CaltechAUTHORS:20110620-085724958,
title = "The quantifier semigroup for bipartite graphs",
journal = "Electronic Journal of Combinatorics",
year = "2011",
url = "https://resolver.caltech.edu/CaltechAUTHORS:20110620-085724958",
id = "record",
issn = "1077-8926",
doi = "10.37236/610",
volume = "18"
}
@inbook{https://resolver.caltech.edu/CaltechAUTHORS:20120509-070406524,
title = "Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms",
chapter = "Dimensionality reduction: beyond the Johnson-Lindenstrauss bound",
year = "2011",
url = "https://resolver.caltech.edu/CaltechAUTHORS:20120509-070406524",
id = "record",
isbn = "978-0-898719-93-2"
}
@article{https://resolver.caltech.edu/CaltechAUTHORS:20110421-134437164,
title = "Clustering Lines in High-Dimensional Space: Classification
of Incomplete Data",
journal = "ACM Transactions on Algorithms",
year = "2010",
url = "https://resolver.caltech.edu/CaltechAUTHORS:20110421-134437164",
id = "record",
issn = "1549-6325",
doi = "10.1145/1868237.1868246",
volume = "7"
}
@inbook{https://resolver.caltech.edu/CaltechAUTHORS:20161121-163001649,
title = "Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms",
chapter = "Universal ε-approximators for integrals",
year = "2010",
url = "https://resolver.caltech.edu/CaltechAUTHORS:20161121-163001649",
id = "record",
isbn = "978-0-89871-701-3",
doi = "10.1137/1.9781611973075.50"
}
@article{https://resolver.caltech.edu/CaltechAUTHORS:20100628-100808011,
title = "Variation on a theorem by Carathéodory",
journal = "Mathematika",
year = "2010",
url = "https://resolver.caltech.edu/CaltechAUTHORS:20100628-100808011",
id = "record",
issn = "0025-5793",
doi = "10.1112/S0025579309000515",
volume = "56"
}
@article{https://resolver.caltech.edu/CaltechAUTHORS:20091130-102029397,
title = "Contraction and Expansion of Convex Sets",
journal = "Discrete and Computational Geometry",
year = "2009",
url = "https://resolver.caltech.edu/CaltechAUTHORS:20091130-102029397",
id = "record",
issn = "0179-5376",
doi = "10.1007/s00454-009-9214-y",
volume = "42"
}
@article{https://resolver.caltech.edu/CaltechAUTHORS:20090824-094016673,
title = "Muirhead-Rado inequality for compact groups",
journal = "Positivity",
year = "2009",
url = "https://resolver.caltech.edu/CaltechAUTHORS:20090824-094016673",
id = "record",
issn = "1385-1292",
doi = "10.1007/s11117-008-2172-4",
volume = "13"
}
@article{https://resolver.caltech.edu/CaltechAUTHORS:20090831-141451771,
title = "Error-Correcting Codes for Automatic Control",
journal = "IEEE Transactions on Information Theory",
year = "2009",
url = "https://resolver.caltech.edu/CaltechAUTHORS:20090831-141451771",
id = "record",
issn = "0018-9448",
doi = "10.1109/TIT.2009.2021303",
volume = "55"
}
@article{https://resolver.caltech.edu/CaltechAUTHORS:20090730-142657667,
title = "Universal immersion spaces for edge-colored graphs and nearest-neighbor metrics",
journal = "SIAM Journal on Discrete Mathematics",
year = "2009",
url = "https://resolver.caltech.edu/CaltechAUTHORS:20090730-142657667",
id = "record",
issn = "0895-4801",
doi = "10.1137/08071555X",
volume = "23"
}
@article{https://resolver.caltech.edu/CaltechAUTHORS:GAOdcg08,
title = "Analysis of Incomplete Data and an Intrinsic-Dimension Helly Theorem",
journal = "Discrete and Computational Geometry",
year = "2008",
url = "https://resolver.caltech.edu/CaltechAUTHORS:GAOdcg08",
id = "record",
issn = "0179-5376",
doi = "10.1007/s00454-008-9107-5",
volume = "40"
}
@inbook{https://resolver.caltech.edu/CaltechAUTHORS:20161025-173435709,
title = "PODC '08 Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing",
chapter = "On a capacitated multivehicle routing problem",
year = "2008",
url = "https://resolver.caltech.edu/CaltechAUTHORS:20161025-173435709",
id = "record",
isbn = "978-1-59593-989-0",
doi = "10.1145/1400751.1400776"
}
@inbook{https://resolver.caltech.edu/CaltechAUTHORS:20161206-174428027,
title = "STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing",
chapter = "On partitioning graphs via single commodity flows",
year = "2008",
url = "https://resolver.caltech.edu/CaltechAUTHORS:20161206-174428027",
id = "record",
isbn = "978-1-60558-047-0",
doi = "10.1145/1374376.1374442"
}
@article{https://resolver.caltech.edu/CaltechAUTHORS:MOOsiamjc08,
title = "The Symmetric Group Defies Strong Fourier Sampling",
journal = "SIAM Journal on Computing",
year = "2008",
url = "https://resolver.caltech.edu/CaltechAUTHORS:MOOsiamjc08",
id = "record",
issn = "0097-5397",
doi = "10.1137/050644896",
volume = "37"
}
@inbook{https://resolver.caltech.edu/CaltechAUTHORS:20161212-164128630,
chapter = "Approximation algorithms for labeling hierarchical taxonomies",
year = "2008",
url = "https://resolver.caltech.edu/CaltechAUTHORS:20161212-164128630",
id = "record"
}
@article{https://resolver.caltech.edu/CaltechAUTHORS:MOOsiamjc07,
title = "The Power of Strong Fourier Sampling: Quantum Algorithms for Affine Groups and Hidden Shifts",
journal = "SIAM Journal on Computing",
year = "2007",
url = "https://resolver.caltech.edu/CaltechAUTHORS:MOOsiamjc07",
id = "record",
doi = "10.1137/S0097539705447177",
volume = "37"
}
@article{https://resolver.caltech.edu/CaltechAUTHORS:SCHUsiamjc07,
title = "Physical Limits of Heat-Bath Algorithmic Cooling",
journal = "SIAM Journal on Computing",
year = "2007",
url = "https://resolver.caltech.edu/CaltechAUTHORS:SCHUsiamjc07",
id = "record",
issn = "0097-5397",
doi = "10.1137/050666023",
volume = "36"
}
@article{https://resolver.caltech.edu/CaltechAUTHORS:DASjmlr07,
title = "A Probabilistic Analysis of EM for Mixtures of Separated, Spherical Gaussians",
journal = "Journal of Machine Learning Research",
year = "2007",
url = "https://resolver.caltech.edu/CaltechAUTHORS:DASjmlr07",
id = "record",
issn = "1533-7928",
volume = "8"
}
@article{https://resolver.caltech.edu/CaltechAUTHORS:20200225-113212660,
title = "Lower bounds for linear locally decodable codes and private information retrieval",
journal = "Computational Complexity",
year = "2006",
url = "https://resolver.caltech.edu/CaltechAUTHORS:20200225-113212660",
id = "record",
issn = "1016-3328",
doi = "10.1007/s00037-006-0216-3",
volume = "15"
}
@inbook{https://resolver.caltech.edu/CaltechAUTHORS:20170511-131811663,
title = "47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06)",
chapter = "The Effectiveness of Lloyd-Type Methods for the k-Means Problem",
year = "2006",
url = "https://resolver.caltech.edu/CaltechAUTHORS:20170511-131811663",
id = "record",
isbn = "0-7695-2720-5",
doi = "10.1109/FOCS.2006.75"
}
@article{https://resolver.caltech.edu/CaltechAUTHORS:20090917-133724756,
title = "Imaging geometry through dynamics: the observable representation",
journal = "Journal of Physics A: Mathematical and General",
year = "2006",
url = "https://resolver.caltech.edu/CaltechAUTHORS:20090917-133724756",
id = "record",
issn = "0305-4470",
doi = "10.1088/0305-4470/39/33/004",
volume = "39"
}
@article{https://resolver.caltech.edu/CaltechAUTHORS:20160419-113716190,
title = "Computing with Highly Mixed States",
journal = "Journal of the ACM",
year = "2006",
url = "https://resolver.caltech.edu/CaltechAUTHORS:20160419-113716190",
id = "record",
issn = "0004-5411",
doi = "10.1145/1147954.1147962",
volume = "53"
}
@article{https://resolver.caltech.edu/CaltechAUTHORS:SCHUjpa06,
title = "Convergence of matrices under random conjugation: wave packet scattering without kinematic entanglement",
journal = "Journal of Physics A: Mathematical and General",
year = "2006",
url = "https://resolver.caltech.edu/CaltechAUTHORS:SCHUjpa06",
id = "record",
issn = "0305-4470",
doi = "10.1088/0305-4470/39/7/015",
volume = "39"
}
@inbook{https://resolver.caltech.edu/CaltechAUTHORS:20161025-171347433,
title = "SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm",
chapter = "Analysis of incomplete data and an intrinsic-dimension Helly theorem",
year = "2006",
url = "https://resolver.caltech.edu/CaltechAUTHORS:20161025-171347433",
id = "record",
isbn = "0-89871-605-5"
}
@inbook{https://resolver.caltech.edu/CaltechAUTHORS:20110818-154937885,
title = "2005 44th IEEE Conference on Decision and Control \& European Control Conference",
chapter = "On Scalar LQG Control with Communication Cost",
year = "2005",
url = "https://resolver.caltech.edu/CaltechAUTHORS:20110818-154937885",
id = "record",
isbn = "0-7803-9567-0",
doi = "10.1109/CDC.2005.1582588"
}
@inbook{https://resolver.caltech.edu/CaltechAUTHORS:20110824-152034750,
title = "46th Annual IEEE Symposium on Foundations of Computer Science",
chapter = "Error-correcting codes for automatic control",
year = "2005",
url = "https://resolver.caltech.edu/CaltechAUTHORS:20110824-152034750",
id = "record",
isbn = "0-7695-2468-0",
doi = "10.1109/SFCS.2005.33"
}
@inbook{https://resolver.caltech.edu/CaltechAUTHORS:20110822-081948476,
title = "46th Annual IEEE Symposium on Foundations of Computer Science",
chapter = "The symmetric group defies strong Fourier sampling",
year = "2005",
url = "https://resolver.caltech.edu/CaltechAUTHORS:20110822-081948476",
id = "record",
isbn = "0-7695-2468-0",
doi = "10.1109/SFCS.2005.73"
}
@inbook{https://resolver.caltech.edu/CaltechAUTHORS:20110817-093537514,
title = "2005 IEEE International Symposium on Information Theory",
chapter = "Real-Time Coding for Multiple Access Channels",
year = "2005",
url = "https://resolver.caltech.edu/CaltechAUTHORS:20110817-093537514",
id = "record",
isbn = "0-7803-9150-0",
doi = "10.1109/ISIT.2005.1523294"
}
@inbook{https://resolver.caltech.edu/CaltechAUTHORS:20161025-172835471,
title = "PODC '05 Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing",
chapter = "Feedback control for router congestion resolution",
year = "2005",
url = "https://resolver.caltech.edu/CaltechAUTHORS:20161025-172835471",
id = "record",
isbn = "1-58113-994-2",
doi = "10.1145/1073814.1073855"
}
@article{https://resolver.caltech.edu/CaltechAUTHORS:20190820-150854373,
title = "A Computationally Motivated Definition Of Parametric Estimation And Its Applications To The Gaussian Distribution",
journal = "Combinatorica",
year = "2005",
url = "https://resolver.caltech.edu/CaltechAUTHORS:20190820-150854373",
id = "record",
issn = "0209-9683",
doi = "10.1007/s00493-005-0028-4",
volume = "25"
}
@article{https://resolver.caltech.edu/CaltechAUTHORS:SCHUprl05,
title = "Physical Limits of Heat-Bath Algorithmic Cooling",
journal = "Physical Review Letters",
year = "2005",
url = "https://resolver.caltech.edu/CaltechAUTHORS:SCHUprl05",
id = "record",
issn = "0031-9007",
doi = "10.1103/PhysRevLett.94.120501",
volume = "94"
}
@inbook{https://resolver.caltech.edu/CaltechAUTHORS:EFFisit04,
title = "IEEE International Symposium on Information Theory (ISIT '04), Chicago, IL, 27 June - 2 July 2004",
chapter = "Rapid near-optimal VQ design with a deterministic data net",
year = "2005",
url = "https://resolver.caltech.edu/CaltechAUTHORS:EFFisit04",
id = "record",
isbn = "0-7803-8280-3",
doi = "10.1109/ISIT.2004.1365336"
}
@article{https://resolver.caltech.edu/CaltechAUTHORS:SCHUieeetnano05,
title = "Wave-packet scattering without kinematic entanglement: convergence of expectation values",
journal = "IEEE Transactions on Nanotechnology",
year = "2005",
url = "https://resolver.caltech.edu/CaltechAUTHORS:SCHUieeetnano05",
id = "record",
issn = "1536-125X",
doi = "10.1109/TNANO.2004.840141",
volume = "4"
}
@article{https://resolver.caltech.edu/CaltechAUTHORS:FRAieeetap04,
title = "A random walk model of wave propagation",
journal = "IEEE Transactions on Antennas and Propagation",
year = "2004",
url = "https://resolver.caltech.edu/CaltechAUTHORS:FRAieeetap04",
id = "record",
issn = "0018-926X",
doi = "10.1109/TAP.2004.827540",
volume = "52"
}
@inbook{https://resolver.caltech.edu/CaltechAUTHORS:20161025-172050851,
title = "SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms",
chapter = "Fair and efficient router congestion control",
year = "2004",
url = "https://resolver.caltech.edu/CaltechAUTHORS:20161025-172050851",
id = "record",
isbn = "0-89871-558-X"
}
@article{https://resolver.caltech.edu/CaltechAUTHORS:20190829-131534342,
title = "Quantum Mechanical Algorithms for the Nonabelian Hidden Subgroup Problem",
journal = "Combinatorica",
year = "2004",
url = "https://resolver.caltech.edu/CaltechAUTHORS:20190829-131534342",
id = "record",
issn = "0209-9683",
doi = "10.1007/s00493-004-0009-8",
volume = "24"
}
@inbook{https://resolver.caltech.edu/CaltechAUTHORS:20161130-165912905,
title = "SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms",
chapter = "The power of basis selection in fourier sampling: hidden subgroup problems in affine groups",
year = "2004",
url = "https://resolver.caltech.edu/CaltechAUTHORS:20161130-165912905",
id = "record",
isbn = "0-89871-558-X"
}
@article{https://resolver.caltech.edu/CaltechAUTHORS:20200518-134456297,
title = "Improved Expansion of Random Cayley Graphs",
journal = "Discrete Mathematics and Theoretical Computer Science",
year = "2004",
url = "https://resolver.caltech.edu/CaltechAUTHORS:20200518-134456297",
id = "record",
issn = "1462-7264",
volume = "6"
}
@article{https://resolver.caltech.edu/CaltechAUTHORS:EVAieeetit03,
title = "On the maximum tolerable noise of k-input gates for reliable computation by formulas",
journal = "IEEE Transactions on Information Theory",
year = "2003",
url = "https://resolver.caltech.edu/CaltechAUTHORS:EVAieeetit03",
id = "record",
issn = "0018-9448",
doi = "10.1109/TIT.2003.818405",
volume = "49"
}
@article{https://resolver.caltech.edu/CaltechAUTHORS:AMBsiamjc03,
title = "The quantum communication complexity of sampling",
journal = "SIAM Journal on Computing",
year = "2003",
url = "https://resolver.caltech.edu/CaltechAUTHORS:AMBsiamjc03",
id = "record",
issn = "0097-5397",
doi = "10.1137/S009753979935476",
volume = "32"
}
@article{https://resolver.caltech.edu/CaltechAUTHORS:20170409-075810379,
title = "A random stacking process",
journal = "Discrete Mathematics",
year = "2002",
url = "https://resolver.caltech.edu/CaltechAUTHORS:20170409-075810379",
id = "record",
issn = "0012-365X",
doi = "10.1016/S0012-365X(02)00512-5",
volume = "257"
}
@inbook{https://resolver.caltech.edu/CaltechAUTHORS:20111102-143056331,
title = "17th IEEE Annual Conference on Computational Complexity",
chapter = "Lower Bounds for Linear Locally Decodable Codes and Private Information Retrieval",
year = "2002",
url = "https://resolver.caltech.edu/CaltechAUTHORS:20111102-143056331",
id = "record",
isbn = "0-7695-1468-5",
doi = "10.1109/CCC.2002.1004353"
}
@other{https://resolver.caltech.edu/CaltechPARADISE:2002.ETR045,
title = "Microcellular Systems, Random Walks, and Wave Propagation",
year = "2002",
url = "https://resolver.caltech.edu/CaltechPARADISE:2002.ETR045",
id = "record"
}
@inbook{https://resolver.caltech.edu/CaltechAUTHORS:20161031-162455553,
title = "STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing",
chapter = "Quantum mechanical algorithms for the nonabelian hidden subgroup problem",
year = "2001",
url = "https://resolver.caltech.edu/CaltechAUTHORS:20161031-162455553",
id = "record",
isbn = "1-58113-349-9",
doi = "10.1145/380752.380769"
}
@article{https://resolver.caltech.edu/CaltechAUTHORS:SCHUieeetit99,
title = "Asymptotically good codes correcting insertions, deletions, and transpositions",
journal = "IEEE Transactions on Information Theory",
year = "1999",
url = "https://resolver.caltech.edu/CaltechAUTHORS:SCHUieeetit99",
id = "record",
issn = "0018-9448",
doi = "10.1109/18.796406",
volume = "45"
}
@article{https://resolver.caltech.edu/CaltechAUTHORS:EVAieeetit99,
title = "Signal propagation and noisy circuits",
journal = "IEEE Transactions on Information Theory",
year = "1999",
url = "https://resolver.caltech.edu/CaltechAUTHORS:EVAieeetit99",
id = "record",
issn = "0018-9448",
doi = "10.1109/18.796377",
volume = "45"
}
@inbook{https://resolver.caltech.edu/CaltechAUTHORS:20111213-142315946,
title = "39th Annual Symposium on Foundations of Computer Science",
chapter = "The quantum communication complexity of sampling",
year = "1998",
url = "https://resolver.caltech.edu/CaltechAUTHORS:20111213-142315946",
id = "record",
isbn = "0-8186-9172-7",
doi = "10.1109/SFCS.1998.743480"
}
@inbook{https://resolver.caltech.edu/CaltechAUTHORS:20120117-151248754,
title = "39th Annual Symposium on Foundations of Computer Science: Proceedings",
chapter = "Pattern Matching for Spatial Point Sets",
year = "1998",
url = "https://resolver.caltech.edu/CaltechAUTHORS:20120117-151248754",
id = "record",
isbn = "0-8186-9172-7",
doi = "10.1109/SFCS.1998.743439"
}
@article{https://resolver.caltech.edu/CaltechAUTHORS:SCHUieeetit96,
title = "Coding for interactive communication",
journal = "IEEE Transactions on Information Theory",
year = "1996",
url = "https://resolver.caltech.edu/CaltechAUTHORS:SCHUieeetit96",
id = "record",
issn = "0018-9448",
doi = "10.1109/18.556671",
volume = "42"
}
@inbook{https://resolver.caltech.edu/CaltechAUTHORS:20120208-152850561,
title = "Proceedings: 37th Annual Symposium on Foundations of Computer Science",
chapter = "Verifying Identities",
year = "1996",
url = "https://resolver.caltech.edu/CaltechAUTHORS:20120208-152850561",
id = "record",
isbn = "0-8186-7594-2",
doi = "10.1109/SFCS.1996.548520"
}
@inbook{https://resolver.caltech.edu/CaltechAUTHORS:20120223-112750729,
title = "36th Annual Symposium on Foundations of Computer Science",
chapter = "Splitters and near-optimal derandomization",
year = "1995",
url = "https://resolver.caltech.edu/CaltechAUTHORS:20120223-112750729",
id = "record",
isbn = "0-8186-7183-1",
doi = "10.1109/SFCS.1995.492475"
}
@inbook{https://resolver.caltech.edu/CaltechAUTHORS:20120216-114451513,
title = "Proceedings: 1995 IEEE International Symposium on Information Theory",
chapter = "Information Theory and Noisy Computation",
year = "1995",
url = "https://resolver.caltech.edu/CaltechAUTHORS:20120216-114451513",
id = "record",
isbn = "0-7803-2453-6",
doi = "10.1109/ISIT.1995.550443"
}
@inbook{https://resolver.caltech.edu/CaltechAUTHORS:20120224-093023413,
title = "1995 IEEE International Symposium on Information Theory, Proceedings",
chapter = "Coding for Distributed Computation",
year = "1995",
url = "https://resolver.caltech.edu/CaltechAUTHORS:20120224-093023413",
id = "record",
isbn = "0-7803-2453-6",
doi = "10.1109/ISIT.1995.550440"
}
@inbook{https://resolver.caltech.edu/CaltechAUTHORS:20120224-084221884,
title = "1995 IEEE International Symposium on Information Theory",
chapter = "Coding for interactive communication",
year = "1995",
url = "https://resolver.caltech.edu/CaltechAUTHORS:20120224-084221884",
id = "record",
isbn = "0-7803-2453-6",
doi = "10.1109/ISIT.1995.550439"
}
@inbook{https://resolver.caltech.edu/CaltechAUTHORS:20120223-084134446,
title = "Proceedings 1994 IEEE-IMS Workshop on Information Theory and Statistics",
chapter = "Coding for distributed computation",
year = "1994",
url = "https://resolver.caltech.edu/CaltechAUTHORS:20120223-084134446",
id = "record",
isbn = "0-7803-2761-6",
doi = "10.1109/WITS.1994.513866"
}
@inbook{https://resolver.caltech.edu/CaltechAUTHORS:20120309-133211732,
title = "34th Annual Symposium on Foundations of Computer Science Proceedings",
chapter = "Signal Propagation, with Application to a Lower Bound on the Depth of Noisy Formulas",
year = "1993",
url = "https://resolver.caltech.edu/CaltechAUTHORS:20120309-133211732",
id = "record",
isbn = "0-8186-4370-6",
doi = "10.1109/SFCS.1993.366827"
}
@inbook{https://resolver.caltech.edu/CaltechAUTHORS:20120328-141319570,
title = "33rd Annual Symposium on Foundations of Computer Science",
chapter = "Communication on noisy channels: a coding theorem for computation",
year = "1992",
url = "https://resolver.caltech.edu/CaltechAUTHORS:20120328-141319570",
id = "record",
isbn = "0-8186-2900-2",
doi = "10.1109/SFCS.1992.267778"
}
@inbook{https://resolver.caltech.edu/CaltechAUTHORS:AWEfocs91,
title = "Foundations of Computer Science, 32nd Annual Symposium. 1-4 Oct. 1991",
chapter = "The maintenance of common data in a distributed system",
year = "1991",
url = "https://resolver.caltech.edu/CaltechAUTHORS:AWEfocs91",
id = "record",
isbn = "0-8186-2445-0",
doi = "10.1109/SFCS.1991.185413"
}