![]() ![]() ![]() | ![]() |
![]() ![]() ![]() ![]() ![]() |
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() |
Note: Links lead to the DBLP on the Web. Martin Strauss 26 Sudipto Guha , Piotr Indyk , S. Muthukrishnan , Martin Strauss: Histogramming Data Streams with Fast Per-Item Processing. ICALP 2002 : 681-692 25 Anna C. Gilbert , Yannis Kotidis , S. Muthukrishnan , Martin Strauss: How to Summarize the Universe: Dynamic Maintenance of Quantiles. VLDB 2002 24 Joan Feigenbaum , Yuval Ishai , Tal Malkin , Kobbi Nissim , Martin Strauss, Rebecca N. Wright : Secure Multiparty Computation of Approximations. ICALP 2001 : 927-938 23 Anna C. Gilbert , Yannis Kotidis , S. Muthukrishnan , Martin Strauss: Optimal and Approximate Computation of Summary Statistics for Range Aggregates. PODS 2001 22 Anna C. Gilbert , Yannis Kotidis , S. Muthukrishnan , Martin Strauss: Surfing Wavelets on Streams: One-Pass Summaries for Approximate Aggregate Queries. VLDB 2001 : 79-88 21 Joan Feigenbaum , Sampath Kannan , Martin Strauss, Mahesh Viswanathan : Testing and spot-checking of data streams (extended abstract). SODA 2000 : 165-174 20 Jessica H. Fong , Martin Strauss: An Approximate L p -Difference Algorithm for Massive Data Streams. STACS 2000 : 193-204 19 Jack H. Lutz , Martin Strauss: Bias Invariance of Small Upper Spans. STACS 2000 : 74-86 18 Harry Buhrman , Dieter van Melkebeek , Kenneth W. Regan , D. Sivakumar , Martin Strauss: A Generalization of Resource-Bounded Measure, with Application to the BPP vs. EXP Problem. SIAM J. Comput. 30 (2): 576-601 (2000) 17 William Aiello , Aviel D. Rubin , Martin Strauss: Using Smartcards to Secure a Personalized Gambling Device. ACM Conference on Computer and Communications Security 1999 : 128-137 16 Joan Feigenbaum , Sampath Kannan , Martin Strauss, Mahesh Viswanathan : An Approximate L 1 -Difference Algorithm for Massive Data Streams. FOCS 1999 : 501-511 15 Haim Kaplan , Martin Strauss, Mario Szegedy : Just the Fax - Differentiating Voice and Fax Phone Lines Using Call Billing Data. SODA 1999 : 935-936 14 Matt Blaze , Gerrit Bleumer , Martin Strauss: Divertible Protocols and Atomic Proxy Cryptography. EUROCRYPT 1998 : 127-144 13 Matt Blaze , Joan Feigenbaum , Martin Strauss: Compliance Checking in the PolicyMaker Trust Management System. Financial Cryptography 1998 : 254-274 12 Harry Buhrman , Dieter van Melkebeek , Kenneth W. Regan , D. Sivakumar , Martin Strauss: A Generalization of Resource-Bounded Measure, With an Application (Extended Abstract). STACS 1998 : 161-171 11 Harry Buhrman , Dieter van Melkebeek , Kenneth W. Regan , Martin Strauss, D. Sivakumar : A Generalization of Resource-Bounded Measure, With Application to the BPP vs. EXP Problem. Electronic Colloquium on Computational Complexity (ECCC) 5 (58): (1998) 10 Jin-yi Cai , D. Sivakumar , Martin Strauss: Constant Depth Circuits and the Lutz Hypothesis. FOCS 1997 : 595-604 9 Joan Feigenbaum , Martin Strauss: An Information-Theoretic Treatment of Random-Self-Reducibility (Extended Abstract). STACS 1997 : 523-534 8 Martin Strauss: Measure on P: Strength of the Notion. Information and Computation 136 (1): 1-23 (1997) 7 Martin Strauss: Normal Numbers and Sources for BPP. TCS 178 (1-2): 155-169 (1997) 6 Yang-Hua Chu , Joan Feigenbaum , Brian A. LaMacchia , Paul Resnick , Martin Strauss: REFEREE: Trust Management for Web Applications. WWW6 / Computer Networks 29 (8-13): 953-964 (1997) 5 Eric Allender , Martin Strauss: Measure on P: Robustness of the Notion. MFCS 1995 : 129-138 4 Martin Strauss: Normal Numbers and Sources for BPP. STACS 1995 : 515-526 3 Eric Allender , Martin Strauss: Measure on P: Robustness of the Notion. Electronic Colloquium on Computational Complexity (ECCC) 2 (28): (1995) 2 Eric Allender , Martin Strauss: Measure on Small Complexity Classes, with Applications for BPP. FOCS 1994 : 807-818 1 Eric Allender , Martin Strauss: Measure on Small Complexity Classes, with Applications for BPP. Electronic Colloquium on Computational Complexity (ECCC) 1 (4): (1994) ![]() DiSC'02 © 2003 Association for Computing Machinery |