default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAndrew J. Blumberg
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j6]Andrew J. Blumberg, Michael Lesnick:
Stability of 2-Parameter Persistent Homology. Found. Comput. Math. 24(2): 385-427 (2024)- [i22]Andrew J. Blumberg, Mathieu Carrière, Jun Hou Fung, Michael A. Mandell:
Resampling and averaging coordinates on data. CoRR abs/2408.01379 (2024) - [i21]Tristan Luca Saidi, Abigail Hickok, Andrew J. Blumberg:
Recovering Manifold Structure Using Ollivier-Ricci Curvature. CoRR abs/2410.01149 (2024) - 2023
- [j5]Yining Liu, Yinuo Jin, Elham Azizi, Andrew J. Blumberg:
Cellstitch: 3D cellular anisotropic image segmentation via optimal transport. BMC Bioinform. 24(1): 480 (2023) - [c19]David Loiseaux, Mathieu Carrière, Andrew J. Blumberg:
A Framework for Fast and Stable Representations of Multiparameter Persistent Homology Decompositions. NeurIPS 2023 - [i20]Anne van Delft, Andrew J. Blumberg:
A statistical framework for analyzing shape in a time series of random geometric objects. CoRR abs/2304.01984 (2023) - [i19]David Loiseaux, Mathieu Carrière, Andrew J. Blumberg:
A Framework for Fast and Stable Representations of Multiparameter Persistent Homology Decompositions. CoRR abs/2306.11170 (2023) - [i18]Abigail Hickok, Andrew J. Blumberg:
An Intrinsic Approach to Scalar-Curvature Estimation for Point Clouds. CoRR abs/2308.02615 (2023) - 2022
- [c18]Sebastian Angel, Andrew J. Blumberg, Eleftherios Ioannidis, Jess Woods:
Efficient Representation of Numerical Optimization Problems for SNARKs. USENIX Security Symposium 2022: 4273-4290 - [i17]David Loiseaux, Mathieu Carrière, Andrew J. Blumberg:
Efficient Approximation of Multiparameter Persistence Modules. CoRR abs/2206.02026 (2022) - 2021
- [i16]Sebastian Angel, Andrew J. Blumberg, Eleftherios Ioannidis, Jess Woods:
Efficient Representation of Numerical Optimization Problems for SNARKs. IACR Cryptol. ePrint Arch. 2021: 1436 (2021) - 2020
- [j4]Luis C. Aparicio
, Mykola Bordyuh, Andrew J. Blumberg, Raul Rabadan:
A Random Matrix Theory Approach to Denoise Single-Cell Data. Patterns 1(3): 100035 (2020) - [c17]Mathieu Carrière, Andrew J. Blumberg:
Multiparameter Persistence Image for Topological Machine Learning. NeurIPS 2020 - [i15]Andrew J. Blumberg, Mathieu Carrière, Michael A. Mandell, Raul Rabadan, Soledad Villar:
MREC: a fast and versatile framework for aligning and matching point clouds with applications to single cell molecular data. CoRR abs/2001.01666 (2020) - [i14]Andrew J. Blumberg, Michael Lesnick:
Stability of 2-Parameter Persistent Homology. CoRR abs/2010.09628 (2020)
2010 – 2019
- 2018
- [i13]Andrew J. Blumberg, Prithwish Bhaumik, Stephen G. Walker:
Testing to distinguish measures on metric spaces. CoRR abs/1802.01152 (2018) - 2017
- [c16]Riad S. Wahby, Ye Ji, Andrew J. Blumberg, Abhi Shelat, Justin Thaler, Michael Walfish, Thomas Wies:
Full Accounting for Verifiable Outsourcing. CCS 2017: 2071-2086 - [i12]Andrew J. Blumberg, Michael Lesnick:
Universality of the Homotopy Interleaving Distance. CoRR abs/1705.01690 (2017) - [i11]Riad S. Wahby, Ye Ji, Andrew J. Blumberg, Abhi Shelat, Justin Thaler, Michael Walfish, Thomas Wies:
Full accounting for verifiable outsourcing. IACR Cryptol. ePrint Arch. 2017: 242 (2017) - 2016
- [c15]Sebastian Angel, Riad S. Wahby, Max Howald, Joshua B. Leners, Michael Spilo, Zhen Sun, Andrew J. Blumberg, Michael Walfish:
Defending against Malicious Peripherals with Cinch. USENIX Security Symposium 2016: 397-414 - [i10]Soledad Villar, Afonso S. Bandeira, Andrew J. Blumberg, Rachel A. Ward:
A polynomial-time relaxation of the Gromov-Hausdorff distance. CoRR abs/1610.05214 (2016) - 2015
- [j3]Michael Walfish, Andrew J. Blumberg:
Verifying computations without reexecuting them. Commun. ACM 58(2): 74-84 (2015) - [c14]Riad S. Wahby, Srinath T. V. Setty, Zuocheng Ren, Andrew J. Blumberg, Michael Walfish:
Efficient RAM and control flow in verifiable outsourced computation. NDSS 2015 - [i9]Riad S. Wahby, Sebastian Angel, Max Howald, Joshua B. Leners, Andrew J. Blumberg, Michael Walfish:
Harmful devices considered harmless. CoRR abs/1506.01449 (2015) - 2014
- [j2]Andrew J. Blumberg, Itamar Gal, Michael A. Mandell, Matthew Pancia:
Robust Statistics, Hypothesis Testing, and Confidence Intervals for Persistent Homology on Metric Measure Spaces. Found. Comput. Math. 14(4): 745-789 (2014) - [c13]Sakellarios Zairis, Hossein Khiabanian, Andrew J. Blumberg, Raul Rabadan:
Moduli Spaces of Phylogenetic Trees Describing Tumor Evolutionary Patterns. Brain Informatics and Health 2014: 528-539 - [i8]Riad S. Wahby, Srinath T. V. Setty, Zuocheng Ren, Andrew J. Blumberg, Michael Walfish:
Efficient RAM and control flow in verifiable outsourced computation. IACR Cryptol. ePrint Arch. 2014: 674 (2014) - [i7]Andrew J. Blumberg, Justin Thaler, Victor Vu, Michael Walfish:
Verifiable computation using multiple provers. IACR Cryptol. ePrint Arch. 2014: 846 (2014) - 2013
- [j1]Andrew J. Blumberg, Michael A. Mandell:
Quantitative Homotopy Theory in Topological Data Analysis. Found. Comput. Math. 13(6): 885-911 (2013) - [c12]Srinath T. V. Setty, Benjamin Braun, Victor Vu, Andrew J. Blumberg, Bryan Parno, Michael Walfish:
Resolving the conflict between generality and plausibility in verified computation. EuroSys 2013: 71-84 - [c11]Benjamin Braun, Ariel J. Feldman, Zuocheng Ren, Srinath T. V. Setty, Andrew J. Blumberg, Michael Walfish:
Verifying computations with state. SOSP 2013: 341-357 - [c10]Victor Vu, Srinath T. V. Setty, Andrew J. Blumberg, Michael Walfish:
A Hybrid Architecture for Interactive Verifiable Computation. IEEE Symposium on Security and Privacy 2013: 223-237 - [i6]Andrew J. Blumberg, Michael A. Mandell:
Quantitative Homotopy Theory in Topological Data Analysis. CoRR abs/1309.6628 (2013) - [i5]Michael Walfish, Andrew J. Blumberg:
Verifying computations without reexecuting them: from theoretical possibility to near-practicality. Electron. Colloquium Comput. Complex. TR13 (2013) - [i4]Benjamin Braun, Ariel J. Feldman, Zuocheng Ren, Srinath T. V. Setty, Andrew J. Blumberg, Michael Walfish:
Verifying computations with state. IACR Cryptol. ePrint Arch. 2013: 356 (2013) - 2012
- [c9]Srinath T. V. Setty, Richard McPherson, Andrew J. Blumberg, Michael Walfish:
Making argument systems for outsourced computation practical (sometimes). NDSS 2012 - [c8]Srinath T. V. Setty, Victor Vu, Nikhil Panpalia, Benjamin Braun, Andrew J. Blumberg, Michael Walfish:
Taking Proof-Based Verified Computation a Few Steps Closer to Practicality. USENIX Security Symposium 2012: 253-268 - [i3]Andrew J. Blumberg, Itamar Gal, Michael A. Mandell, Matthew Pancia:
Persistent homology for metric measure spaces, and robust statistics for hypothesis testing and confidence intervals. CoRR abs/1206.4581 (2012) - [i2]Srinath T. V. Setty, Victor Vu, Nikhil Panpalia, Benjamin Braun, Andrew J. Blumberg, Michael Walfish:
Taking proof-based verified computation a few steps closer to practicality (extended version). IACR Cryptol. ePrint Arch. 2012: 598 (2012) - [i1]Srinath T. V. Setty, Benjamin Braun, Victor Vu, Andrew J. Blumberg, Bryan Parno, Michael Walfish:
Resolving the conflict between generality and plausibility in verified computation. IACR Cryptol. ePrint Arch. 2012: 622 (2012) - 2011
- [c7]Raluca A. Popa, Andrew J. Blumberg, Hari Balakrishnan, Frank H. Li:
Privacy and accountability for location-based aggregate statistics. CCS 2011: 653-666 - [c6]Andrew J. Blumberg:
Toward Practical and Unconditional Verification of Remote Computations. HotOS 2011
2000 – 2009
- 2009
- [c5]Raluca A. Popa, Hari Balakrishnan, Andrew J. Blumberg:
VPriv: Protecting Privacy in Location-Based Vehicular Services. USENIX Security Symposium 2009: 335-350 - 2006
- [c4]Andrew Justin Blumberg, Robin Chase:
Congestion Pricing That Preserves Driver Privacy. ITSC 2006: 725-732 - 2004
- [c3]Andrew J. Blumberg, Abhi Shelat:
Searching for Stable Mechanisms: Automated Design for Imperfect Players. AAAI 2004: 8-13
1990 – 1999
- 1997
- [c2]Andrew J. Blumberg:
Parallel computation on a DNA substrate. DNA Based Computers 1997: 265-279 - [c1]Andrew J. Blumberg:
A Randomized Algorithm for Deciding the Functional Equivalence of Neural Networks. ICONIP (1) 1997: 215-216
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-11-06 20:29 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
