Martin Strauss

According to our database1, Martin Strauss authored at least 83 papers between 1994 and 2017.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepage:

On csauthors.net:

Bibliography

2017
For-All Sparse Recovery in Near-Optimal Time.
ACM Trans. Algorithms, 2017

Fair Pipelines.
CoRR, 2017

2016
Approximate Histogram and Wavelet Summaries of Streaming Data.
Proceedings of the Data Stream Management - Processing High-Speed Data Streams, 2016

2015
What's the Frequency, Kenneth?: Sublinear Fourier Sampling Off the Grid.
Algorithmica, 2015

2014
For-all Sparse Recovery in Near-Optimal Time.
CoRR, 2014

For-All Sparse Recovery in Near-Optimal Time.
Proceedings of the Automata, Languages, and Programming - 41st International Colloquium, 2014

2013
L2/L2-foreach sparse recovery with low risk
CoRR, 2013

ℓ2/ℓ2-Foreach Sparse Recovery with Low Risk.
Proceedings of the Automata, Languages, and Programming - 40th International Colloquium, 2013

2012
Approximate Sparse Recovery: Optimizing Time and Measurements.
SIAM J. Comput., 2012

Reusable low-error compressive sampling schemes through privacy.
Proceedings of the IEEE Statistical Signal Processing Workshop, 2012

Sublinear time, measurement-optimal, sparse recovery for all.
Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms, 2012

Recovering simple signals.
Proceedings of the 2012 Information Theory and Applications Workshop, 2012

What's the Frequency, Kenneth?: Sublinear Fourier Sampling Off the Grid.
Proceedings of the Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, 2012

2011
Public Key Locally Decodable Codes with Short Keys.
Electronic Colloquium on Computational Complexity (ECCC), 2011

Public Key Locally Decodable Codes with Short Keys.
Proceedings of the Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, 2011

2010
Space-optimal heavy hitters with strong error bounds.
ACM Trans. Database Syst., 2010

Sublinear Time, Measurement-Optimal, Sparse Recovery For All
CoRR, 2010

Approximate sparse recovery: optimizing time and measurements.
Proceedings of the 42nd ACM Symposium on Theory of Computing, 2010

2009
Histograms on Streams.
Proceedings of the Encyclopedia of Database Systems, 2009

Private multiparty sampling and approximation of vector combinations.
Theor. Comput. Sci., 2009

Approximate Sparse Recovery: Optimizing Time and Measurements
CoRR, 2009

Space-optimal heavy hitters with strong error bounds.
Proceedings of the Twenty-Eigth ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, 2009

Near-optimal Bayesian localization via incoherence and sparsity.
Proceedings of the 8th International Conference on Information Processing in Sensor Networks, 2009

2008
Combining geometry and combinatorics: A unified approach to sparse signal recovery
CoRR, 2008

Fast Private Norm Estimation and Heavy Hitters.
Proceedings of the Theory of Cryptography, Fifth Theory of Cryptography Conference, 2008

On the feasibility of hardware implementation of sub-Nyquist random-sampling based analog-to-information conversion.
Proceedings of the International Symposium on Circuits and Systems (ISCAS 2008), 2008

Fundamental performance bounds for a compressive sampling system.
Proceedings of the IEEE International Conference on Acoustics, 2008

2007
Analysis of Data Streams: Computational and Algorithmic Challenges.
Technometrics, 2007

One sketch for all: fast algorithms for compressed sensing.
Proceedings of the 39th Annual ACM Symposium on Theory of Computing, 2007

Sparse Gradient Image Reconstruction Done Faster.
Proceedings of the International Conference on Image Processing, 2007

Fast Line-Based Imaging of Small Sample Features.
Proceedings of the IEEE International Conference on Acoustics, 2007

Private Multiparty Sampling and Approximation of Vector Combinations.
Proceedings of the Automata, Languages and Programming, 34th International Colloquium, 2007

2006
Secure multiparty computation of approximations.
ACM Trans. Algorithms, 2006

Algorithms for simultaneous sparse approximation. Part I: Greedy pursuit.
Signal Processing, 2006

Maintaining time-decaying stream aggregates.
J. Algorithms, 2006

Private Approximate Heavy Hitters
CoRR, 2006

Algorithmic linear dimension reduction in the l_1 norm for sparse vectors
CoRR, 2006

List decoding of noisy Reed-Muller-like codes
CoRR, 2006

2005
Domain-Driven Data Synopses for Dynamic Quantiles.
IEEE Trans. Knowl. Data Eng., 2005

Better Alternatives to OSPF Routing.
Algorithmica, 2005

Improved range-summable random variable construction algorithms.
Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2005

Simultaneous sparse approximation via greedy pursuit.
Proceedings of the 2005 IEEE International Conference on Acoustics, 2005

Workload-Optimal Histograms on Streams.
Proceedings of the Algorithms, 2005

2003
One-Pass Wavelet Decompositions of Data Streams.
IEEE Trans. Knowl. Data Eng., 2003

Rangesum histograms.
Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2003

Approximation of functions over redundant dictionaries using coherence.
Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2003

Maintaining time-decaying stream aggregates.
Proceedings of the Twenty-Second ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, 2003

Improved sparse approximation over quasiincoherent dictionaries.
Proceedings of the 2003 International Conference on Image Processing, 2003

Maintenance of Multidimensional Histograms.
Proceedings of the FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science, 2003

2002
An Approximate L1-Difference Algorithm for Massive Data Streams.
SIAM J. Comput., 2002

Testing and Spot-Checking of Data Streams.
Algorithmica, 2002

How to Summarize the Universe: Dynamic Maintenance of Quantiles.
Proceedings of the VLDB 2002, 2002

Near-optimal sparse fourier representations via sampling.
Proceedings of the Proceedings on 34th Annual ACM Symposium on Theory of Computing, 2002

Fast, small-space algorithms for approximate histogram maintenance.
Proceedings of the Proceedings on 34th Annual ACM Symposium on Theory of Computing, 2002

Histogramming Data Streams with Fast Per-Item Processing.
Proceedings of the Automata, Languages and Programming, 29th International Colloquium, 2002

2001
Secure Multiparty Computation of Approximations.
IACR Cryptology ePrint Archive, 2001

An Approximate Lp Difference Algorithm for Massive Data Streams.
Discrete Mathematics & Theoretical Computer Science, 2001

Surfing Wavelets on Streams: One-Pass Summaries for Approximate Aggregate Queries.
Proceedings of the VLDB 2001, 2001

Optimal and Approximate Computation of Summary Statistics for Range Aggregates.
Proceedings of the Twentieth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, 2001

Secure Multiparty Computation of Approximations.
Proceedings of the Automata, Languages and Programming, 28th International Colloquium, 2001

2000
A Generalization of Resource-Bounded Measure, with Application to the BPP vs. EXP Problem.
SIAM J. Comput., 2000

Bias Invariance of Small Upper Spans.
Proceedings of the STACS 2000, 2000

An Approximate Lp-Difference Algorithm for Massive Data Streams.
Proceedings of the STACS 2000, 2000

Testing and spot-checking of data streams (extended abstract).
Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2000

1999
Just the Fax - Differentiating Voice and Fax Phone Lines Using Call Billing Data.
Proceedings of the Tenth Annual ACM-SIAM Symposium on Discrete Algorithms, 1999

An Approximate L1-Difference Algorithm for Massive Data Streams.
Proceedings of the 40th Annual Symposium on Foundations of Computer Science, 1999

Using Smartcards to Secure a Personalized Gambling Device.
Proceedings of the CCS '99, 1999

1998
A Generalization of Resource-Bounded Measure, With Application to the BPP vs. EXP Problem
Electronic Colloquium on Computational Complexity (ECCC), 1998

A Generalization of Resource-Bounded Measure, With an Application (Extended Abstract).
Proceedings of the STACS 98, 1998

Compliance Checking in the PolicyMaker Trust Management System.
Proceedings of the Financial Cryptography, 1998

Divertible Protocols and Atomic Proxy Cryptography.
Proceedings of the Advances in Cryptology - EUROCRYPT '98, International Conference on the Theory and Application of Cryptographic Techniques, Espoo, Finland, May 31, 1998

1997
Referee: trust management for Web applications.
World Wide Web Journal, 1997

Normal Numbers and Sources for BPP.
Theor. Comput. Sci., 1997

Measure on P: Strength of the Notion.
Inf. Comput., 1997

Managing trust in an information-labeling system.
European Transactions on Telecommunications, 1997

REFEREE: Trust Management for Web Applications.
Computer Networks, 1997

An Information-Theoretic Treatment of Random-Self-Reducibility (Extended Abstract).
Proceedings of the STACS 97, 14th Annual Symposium on Theoretical Aspects of Computer Science, Lübeck, Germany, February 27, 1997

Constant Depth Circuits and the Lutz Hypothesis.
Proceedings of the 38th Annual Symposium on Foundations of Computer Science, 1997

1995
Measure on P: Robustness of the Notion
Electronic Colloquium on Computational Complexity (ECCC), 1995

Normal Numbers and Sources for BPP.
STACS, 1995

Measure on P: Robustness of the Notion.
Proceedings of the Mathematical Foundations of Computer Science 1995, 1995

1994
Measure on Small Complexity Classes, with Applications for BPP
Electronic Colloquium on Computational Complexity (ECCC), 1994

Measure on Small Complexity Classes, with Applications for BPP
Proceedings of the 35th Annual Symposium on Foundations of Computer Science, 1994


  Loading...